Autonomous Knowledge-oriented Clustering Using Decision-Theoretic Rough Set Theory

• Autorzy: Yu H. , Chu S. , Yang D.
• Języki publikacji: EN

Abstrakty

EN

In many applications, clusters tend to have vague or imprecise boundaries. It is desirable that clustering techniques should consider such an issue. The decision-theoretic rough set (DTRS) model is a typical probabilistic rough set model, which has the ability to deal with imprecise, uncertain, and vague information. This paper proposes an autonomous clustering method using the decision-theoretic rough set model based on a knowledge-oriented clustering framework. In order to get the initial knowledge-oriented clustering, the threshold values are produced autonomously based on semantics of clustering without human intervention. Furthermore, this paper estimates the risk of a clustering scheme based on the decision-theoretic rough set by considering various loss functions, which can process the different granular overlapping boundary. An autonomous clustering algorithm is proposed, which is not only experimented with the synthetic data and the standard data but also applied in the web search results clustering. The results of experiments show that the proposed method is effective and efficient.

Słowa kluczowe

EN

clustering; knowledge-oriented clustering; decision-theoretic rough set theory; autonomous; data mining

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2012
• Tom: Vol. 115, nr 2/3
• Strony: 141--156
• Opis fizyczny: Bibliogr. 23 poz., tab., wykr.

Twórcy

autor

Yu H.

autor

Chu S.

autor

Yang D.

• Institute of Computer Science and Technology Chongqing University of Posts and Telecommunications Chongqing, 400065, P.R. China,

Bibliografia

• [1] Carrot2: open source framework for building search clustering engines: http://project.carrot2.org/index.html.
• [2] UCIrvine Machine Learning Repository: http://archive.ics.uci.edu/ml/.
• [3] Asharaf, S., Murty, M.: An adaptive rough fuzzy single pass algorithm for clustering large data sets, Pattern Recognition, 36, 2003, 3015-3018.
• [4] Bean, C., Kambhampati, C.: Autonomous clustering Using Rough Set Theory, International Journal of Automation and Computing, 05(1), 2008, 90-102.
• [5] Ciucci, D.: A Unifying Abstract Approach for Rough Models, Proceedings of the Third International Conference on Rough Sets and Knowledge Technology (RSKT08), 2008.
• [6] Falkenauer, E.: Genetic Algorithms and Grouping Problems, John Wiley & Sons, 1998.
• [7] Herbert, J., Yao, J.: Learning Optimal Parameters in Decision-Theoretic Rough Sets, Proceedings of Rough Sets and Knowledge Technology (RSKT09), Gold Coast, Australia, 2009.
• [8] Hirano, S., Tsumoto, S.: A Knowledge-orientedClustering Technique Based on Rough Sets., In Proceedings of 25th IEEE International Conference on Computer and Software Applications, Chicago, USA, 2001.
• [9] Li, Y., Zhang, C., Swanb, J.: An information filtering model on the Web and its application in JobAgent, Knowledge-Based Systems, 13, 2000, 285-296.
• [10] Lingras, P., Chen, M., Miao, D.: Rough Cluster Quality Index Based on Decision Theory., IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 21(7), 2009, 1014-1026.
• [11] Liu, D., Li, H., Zhou, X.: Two decadesresearch on decision-theoretic rough sets, Proceedings of 9th IEEE International Conference on Cognitive Informatics,ICCI2010, Beijing,China, July 2010.
• [12] Liu, S., Hu, F., Jia, Z., Shi, Z.: A Rough Set-Based Hierarchical Clustering Algorithm, JOURNAL OF COMPUTER RESEARCH AND DEVELOPMENT, 41(4), 2004, 552-557.
• [13] Ngo, C., Nguyen, H.: A Method of Web Search Result Clustering Based on Rough Sets, IEEE/WIC/ACM International Conference on Web Intelligence(WI'05), 2005.
• [14] Osiński, S.,Weiss, D.: Conceptual Clustering Using Lingo Algorithm: Evaluation on Open Directory Project Data, Advances in Soft Computing, Intelligent Information Processing and Web Mining, Proceedings of the International IIS: IIPWM04 Conference, Zakopane, Poland, 2004.
• [15] Pawlak, Z.: Rough sets, International Journal of Computer and Information Sciences., 11, 1982, 341-356.
• [16] Saha, S.,Murthy, C., Pal, S.: Rough Set Based Ensemble Classifier forWeb Page Classification., Fundamenta Informaticae, 76(1-2), 2007, 171-187.
• [17] Serban, G., Campan, A.: Hierarchical Adaptive Clustering, Informatica, 19(1), 2008, 101-112.
• [18] Stefanowski, J., Weiss, D.: Carrot2 and Language Properties in Web Search Results Clustering, Lecture Notes in Artificial Intelligence: Advances in Web Intelligence, Proceedings of the First International Atlantic Web Intelligence Conference, Madrit, Spain, 2003.
• [19] Wu, X., Zhou, J.: A novel possibilistic fuzzy c-means clustering, ACTA Electronica Sinica, 10, 2008, 1996-2000.
• [20] Yao, Y.: Three-way decisions with probabilistic rough sets, Information Sciences, 180(3), 2010, 341-353.
• [21] Yao, Y.: The superiority of three-way decisions in probabilistic rough set models, Information Sciences, 181(6), 2011, 1080-1096.
• [22] Yao, Y., Wong, S.: A decision-theoretic framework for approximating concepts, International Journal of Man-machine Studies, 37(6), 1992, 793-809.
• [23] Yu, H., Luo, H.: A Novel Possibilistic Fuzzy Leader Clustering Algorithm, International Journal of Hybrid Intelligent Systems, 8(1), 2011, 31-40.