Hybrid clustering for large sequential data
Conference Publication ResearchOnline@JCUAbstract
Many scientific and commercial domains have witnessed enormous data explosion that has inherent sequential nature. While clustering sequential data is useful for various purposes, there has been less success due to the discrete nature of sequential data. We combine techniques from data mining and computational geometry to efficiently and effectively segment sequential web usage data in data-rich environments. We provide an hybrid O(n n) clustering algorithm that combines medoid-based partitioning and agglomerative hierarchial clustering. This hybridization is inspired by geometrical and topological aspects of the Voronoi diagram. Experimental results demonstrate the superiority of our hybridization over traditional approaches.
Journal
N/A
Publication Name
AIPR-07 - International Conference on Artificial Intelligence and Pattern Recognition
Volume
N/A
ISBN/ISSN
978-0-9727412-3-1
Edition
N/A
Issue
N/A
Pages Count
6
Location
Orlando, Florida, USA
Publisher
ISRST
Publisher Url
N/A
Publisher Location
USA
Publish Date
N/A
Url
N/A
Date
N/A
EISSN
N/A
DOI
N/A