Title :
Algorithm accuracy and complexity optimization by inequality merging for data clustering
Author :
Melnyk, Roman ; Tushnytskyy, Ruslan
Author_Institution :
Software Dept., Lviv Polytech. Nat. Univ., Lviv, Ukraine
Abstract :
The clustering agglomerative hierarchical algorithm for date grouping is considered. To reduce algorithmic complexity without accuracy losses an approach with the speed and accuracy coefficient is proposed. Some results with quality characteristics of clustered data are presented.
Keywords :
computational complexity; pattern clustering; agglomerative hierarchical algorithm; complexity optimization; data clustering; date grouping; inequality merging; Clustering algorithms; Costs; Couplings; Instruments; Merging; Pattern analysis; Pattern recognition; Polynomials; Software algorithms; Software quality; cluster; data points; hierarchical tree; rolling-up algorithm; specific density and volume functions; speed and accuracy coefficient;
Conference_Titel :
CAD Systems in Microelectronics, 2009. CADSM 2009. 10th International Conference - The Experience of Designing and Application of
Conference_Location :
Lviv-Polyana
Print_ISBN :
978-966-2191-05-9
