TIE algorithm: a layer over clustering-based taxonomy generation for handling evolving data

Rabia IRFAN, Sharifullah KHAN, Kashif RAJPOOT, Ali Mustafa QAMAR

PDF(957 KB)
PDF(957 KB)
Front. Inform. Technol. Electron. Eng ›› 2018, Vol. 19 ›› Issue (6) : 763-782. DOI: 10.1631/FITEE.1700517
Orginal Article
Orginal Article

TIE algorithm: a layer over clustering-based taxonomy generation for handling evolving data

Author information +
History +

Abstract

Taxonomy is generated to effectively organize and access large volume of data. A taxonomy is a way of representing concepts that exist in data. It needs to continuously evolve to reflect changes in data. Existing automatic taxonomy generation techniques do not handle the evolution of data; therefore, the generated taxonomies do not truly represent the data. The evolution of data can be handled by either regenerating taxonomy from scratch, or allowing taxonomy to incrementally evolve whenever changes occur in the data. The former approach is not economical in terms of time and resources. A taxonomy incremental evolution (TIE) algorithm, as proposed, is a novel attempt to handle the data that evolve in time. It serves as a layer over an existing clustering-based taxonomy generation technique and allows an existing taxonomy to incrementally evolve. The algorithm was evaluated in research articles selected from the computing domain. It was found that the taxonomy using the algorithm that evolved with data needed considerably shorter time, and had better quality per unit time as compared to the taxonomy regenerated from scratch.

Keywords

Taxonomy / Clustering algorithms / Information science / Knowledge management / Machine learning

Cite this article

Download citation ▾
Rabia IRFAN, Sharifullah KHAN, Kashif RAJPOOT, Ali Mustafa QAMAR. TIE algorithm: a layer over clustering-based taxonomy generation for handling evolving data. Front. Inform. Technol. Electron. Eng, 2018, 19(6): 763‒782 https://doi.org/10.1631/FITEE.1700517

RIGHTS & PERMISSIONS

2018 Zhejiang University and Springer-Verlag GmbH Germany, part of Springer Nature
PDF(957 KB)

Accesses

Citations

Detail

Sections
Recommended

/