SPICE: A New Framework for Data Mining based on Probability Logic and Formal Concept Analysis

• Autorzy: Jiang L. , Deogun J.
• Języki publikacji: EN

Abstrakty

EN

Formal concept analysis and probability logic are two useful tools for data analysis. Data is usually represented as a two-dimensional context of objects and features. FCA discovers dependencies within the data based on the relation among objects and features. On the other hand, the probability logic represents and reasons with both statistical and propositional probability among data. We propose SPICE - Symbolic integration of Probability Inference and Concept Extraction, which provides a more flexible and robust framework for data mining tasks. Within SPICE, we formalize the important notions of data mining, such as concepts and patterns, and develop new notions such as maximal potentially useful patterns. In this paper, we formalize the association rule mining in SPICE and propose an enhanced rule mining approach, called SPICE association rule mining, to solve the problem of time inefficiency and rule redundancy in general association rule mining. We show an application of the SPICE approach in the Geo-spatial Decision Support System (GDSS). The experimental results show that SPICE can efficiently and effectively discover a succinct set of interesting association rules.

Słowa kluczowe

EN

FCA; formal concept analysis; probability logic; data mining; association rules; redundant rules; important items

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2007
• Tom: Vol. 78, nr 4
• Strony: 467--485
• Opis fizyczny: bibliogr. 19 poz., wykr.

Twórcy

autor

Jiang L.

autor

Deogun J.

• Department of Computer Science and Engineering, University of Nebraaska - Lincoln, Lincoln NE, 68588-0115, USA,

Bibliografia

• [1] R. Agrawal, T. Imielinski, and A. N. Swami. Mining association rules between sets of items in large databases. In Proceedings of the 1993 International Conference on Management of Data, 1993.
• [2] R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Proceedings of 20th International Conference on Very Large Data Bases, Santiago de Chile, Chile, 1994.
• [3] F. Bacchus. Representing and Reasoning With Probabilistic Knowledge. MIT Press, Cambridge, Massachusetts, London, England, 1990.
• [4] Ferenc Bodon. A fast apriori implementation. In Workshop on Frequent Itemset Mining Implementations (FIMI), Melbourne, Florida, USA, 2003.
• [5] S. Demri and E. Orłowska. Logical analysis of indiscernibility. In Incomplete Information: Rough Set Analysis, pages 347-380. Physica Verlag, Heidelberg, 1997.
• [6] Jitender Deogun and Liying Jiang. Discovering maximal potentially useful association rules based onprobability logics. In Proceedings of the Fourth International Conference on Rough Sets and Current Trends in Computing (RSCTC), 2004.
• [7] Jitender Deogun, Liying Jiang, Ying Xie, and Vijay Raghavan. Probability logic modeling of knowledge discovery in databases. In The 14th International Symposium on Methodologies for Intelligent Systems (ISMIS) Maebashi City, Japan, October 28-31, 2003.
• [8] Jitender S. Deogun and Liying Jiang. SARM - succinct association rule mining: An approach to enhance association mining. In Proceedings of Foundations of Intelligent Systems, 15th International Symposium (ISMIS), Saratoga Springs, NY, USA, May 25-28, pages 121-130, 2005.
• [9] Jitender S. Deogun and Liying Jiang. Spice: A novel approach to data analysis. In Proceedings of the 2nd Indian International Conference on Artificial Intelligence (IICAI 2005), Pune, India, December 20-22, 2005.
• [10] Melvin Fitting and Richard L. Mendelsohn. First-order modal logic. Kluwer Academic Publishers, Norwell, MA, USA, 1999.
• [11] B. Ganter and R. Wille. Formal concept analsis: Mathematical foundations, berlin, 1999.
• [12] Jiawei Han, Jian Pei, and Yiwen Yin. Mining frequent patterns without candidate generation. In Proceedings of the 2000 ACM SIGMOD international conference on Management of data. ACM Press, 2000.
• [13] Vijay Raghavan, Peter Bollmann, and Gwang S. Jung. A critical investigation of recall and precision as measures of retrieval system performance. ACM Trans. Inf. Syst., 7(3):205-229, 1989.
• [14] Jamil Saquer and Jitender S. Deogun. Formal rough concept analysis. In RSFDGrC, pages 91-99, 1999.
• [15] Brin Sergey, Rajeev Motwani, Jeffrey D. Ullman, and Shalom Tsur. Dynamic itemset counting and implication rules for market basket data. In Proceedings of the 1997 ACM SIGMOD international conference on Management of data, pages 255-264, 1997.
• [16] Y.Y. Yao. Granular computing: basic issues and possible solutions. In Proceedings of the 5th Joint Conference on Information Sciences, pages 186-189, 2000.
• [17] Y.Y. Yao and Y. Chen. Rough set approximations in formal concept analysis. In Processing of IEEE Annual Meeting of the Fuzzy Information (NAFIPS), volume 1, pages 73-78, 2004.
• [18] Y.Y. Yao and J. Yao. Granular computing as a basis for consistent classification problems. In Proceedings of PAKDD'02 Workshop on Toward the Foundation of Data Mining, pages 101-106.
• [19] Zijian Zheng, Ron Kohavi, and Llew Mason. Real world performance of association rule algorithms. In Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 401-406, 2001.