k-ATTRACTORS: A PARTITIONAL CLUSTERING ALGORITHM FOR NUMERIC DATA ANALYSIS

REFERENCES

• Agarwal , R. , and Srikant , R. 1994 . Fast algorithms for mining association rules in large databases . In Proceedings of 20th International Conference VLDB , 487 – 499 . Santiago de Chile. Chile: Morgan Kaufman.
   Google Scholar
• Bodon , F. 2005 . A Trie-based APRIORI implementation for mining frequent item sequences. OSDM. In Proceedings of the 1st International Workshop on Open Source Data Mining: Frequent Pattern Mining Implementations. New York: ACM.
   Google Scholar
• Fung , B. C. M. , Wang , K. , and Ester , M. 2003 . Hierarchical document clustering using frequent itemsets . In Proceedings of the 3rd SIAM International Conference on Data Mining. San Francisco, CA: SIAM.
   Google Scholar
• Han , E. H. , Karypis , G. , Kumar , V. , and Mobasher , B. 1997 . Clustering based on association rule hypergraphs . In Research Issues on Data Mining and Knowledge Discovery. Tuscon, AZ: ACM .
   Google Scholar
• Han , J. , and Kamber , M. 2001 . Data mining: Concepts and techniques . San Diego , CA : Academic Press .
   Google Scholar
• Hartigan , J. A. 1975 . Clustering algorithms . New York , NY : John Wiley & Sons .
   Google Scholar
• Jain , A. K. , Murty , M. N. , and Flynn , P. J. 1999 . Data clustering: A review . ACM Computing Surveys 31 : 264 – 323 .
   Web of Science ®Google Scholar
• Jing , L. , Ng , M. K. , and Zhexue , J. 2007 . An entropy weighting k-means algorithm for subspace clustering of high-dimensional sparse data . IEEE Transactions on Knowledge and Data Engineering 19 : 1026 – 1041 .
   Web of Science ®Google Scholar
• Kanellopoulos , Y. , Antonellis , P. , Tjortjis , C. , and Makris , C. 2007 . k-Attractors, A clustering algorithm for software measurement data analysis . In Proceedings of IEEE 19th International Conference on Tools for Artificial Intelligence (ICTAI 2007) . Patras , Greece : IEEE Computer Society Press .
   Google Scholar
• Karypis , G. , and Kumar , V. 1998 . Multilevel k-way partitioning scheme for irregular graphs . Journal of Parallel and Distributed Computing 48 : 96 – 129 .
   Web of Science ®Google Scholar
• Kosters , W. A. , Marchiori , E. , and Oerlemans , A. A. J. 1999 . Mining clusters with association rules . Lecture Notes in Computer Science 1642 : 39 – 50 .
   Google Scholar
• Li , W. , Ng , W.-K. , Liu , Y. , and Ong , K.-L. 2007 . Enhancing the effectiveness of clustering with spectra analysis . IEEE Transactions on Knowledge and Data Engineering 17 : 887 – 902 .
   Google Scholar
• Lin , C.-R. , Liu , K.-H. , and Chen , M.-S. 2005 . Dual clustering: Integrating data clustering over optimization and constraint domains . IEEE Transactions on Knowledge and Data Engineering 17 : 628 – 637 .
   Web of Science ®Google Scholar
• Manilla , H. , Toivonen , H. , and Verkamo , A. I. 1995 . Discovering frequent episodes in sequences . In Proceedings of the First International Conference on Knowledge Discovery and Data Mining , 210 – 215 . Montreal , Quebec , Canada , AAAI Press .
   Google Scholar
• Patrikainen , A. , and Meila , M. 2006 . Comparing subspace clusterings . IEEE Transactions on Knowledge and Data Engineering 18 : 902 – 916 .
   Web of Science ®Google Scholar
• Wang , K. , Xu , C. , and Liu , B. 1999 . Clustering transactions using large items . In Proceedings of the 8th ACM International Conference on Information and Knowledge Management , 483 – 490 . Kansas City , MO : ACM .
   Google Scholar
• Witten , I. H. , and Frank , E. 2005 . Data mining: Practical machine learning tools and techniques, , 2nd ed . San Francisco : Morgan Kaufmann .
   Google Scholar
• Zhuang , L. , and Dai , H. 2004 . A maximal frequent itemset approach for web document clustering . In Proceedings of the 4th IEEE International Conference on Computer and Information Technology (IEEE CIT′04 September 14–16). Wuhan, China: IEEE .
   Google Scholar