This Article 
 Bibliographic References 
 Add to: 
Peculiarity Oriented Multidatabase Mining
July/August 2003 (vol. 15 no. 4)
pp. 952-960

AbstractPeculiarity rules are a new class of rules which can be discovered by searching relevance among a relatively small number of peculiar data. Peculiarity oriented mining in multiple data sources is different from, and complementary to, existing approaches for discovering new, surprising, and interesting patterns hidden in data. A theoretical framework for peculiarity oriented mining is presented. Within the proposed framework, we give a formal interpretation and comparison of three classes of rules, namely, association rules, exception rules, and peculiarity rules, as well as describe how to mine interesting peculiarity rules in multiple databases.

[1] R. Agrawal et al., Fast Discovery of Association Rules Advances in Knowledge Discovery and Data Mining, pp. 307-328, 1996.
[2] J.M. Aronis et al., The WoRLD: Knowledge Discovery from Multiple Distributed Databases Proc. 10th Ann. Conf. Florida AI Research Society (FLAIRS '97), pp. 337-341, 1997.
[3] G.K. Bhattacharyya and R.A. Johnson, Statistical Concepts and Methods. John Wiley&Sons, 1977.
[4] G. Dong and J. Li, Efficient Mining of Emerging Patterns: Discovering Trends and Differences Proc. Fifth Int'l Conf. Knowledge Discovery in Databases (KDD '99), pp. 43-52, 1999.
[5] A.A. Freitas, On Objective Measures of Rule Surprisingness Proc. Second European Symp. Principles of Data Mining and Knowledge Discovery (PKDD '98), pp. 1-9, 1998.
[6] R.J. Hilderman and H.J. Hamilton, Evaluation of Interestingness Measures for Ranking Discovered Knowledge Proc. Pacific-Asia Conf. Knowledge Discovery and Data Mining (PAKDD '01), pp. 247-259, 2001.
[7] R.A. Johnson and D.W. Wichern, Applied Multivariate Statistical Analysis. Prentice Hall, 1998.
[8] T.Y. Lin, Granular Computing on Binary Relations 1: Data Mining and Neighborhood Systems Rough Sets in Knowledge Discovery, L. Polkowski and A. Skowron, eds., vol. 1, pp. 107-121, Physica-Verlag, 1998.
[9] H. Liu, H. Lu, and J. Yao, Identifying Relevant Databases for Multidatabase Mining Proc. Second Pacific-Asia Conf. Knowledge Discovery and Data Mining (PAKDD '98), pp. 210-221, 1998.
[10] B. Liu, W. Hsu, S. Chen, and Y. Ma, Analyzing the Subjective Interestingness of Association Rules IEEE Intelligent Systems, vol. 15, no. 5, pp. 47-55, Sept./Oct. 2000.
[11] Z. Pawlak, Rough Sets, Theoretical Aspects of Reasoning about Data. Kluwer, 1991.
[12] J.S. Ribeiro, K.A. Kaufman, and L. Kerschberg, Knowledge Discovery from Multiple Databases Proc. First Int'l Conf. Knowledge Discovery and Data Mining (KDD '95), pp. 240-245, 1995.
[13] E. Suzuki, Autonomous Discovery of Reliable Exception Rules Proc. Third Int'l Conf. Knowledge Discovery and Data Mining (KDD '97), pp. 259-262, 1997.
[14] S. Thrun et al., Automated Learning and Discovery AI Magazine, pp. 78-82, Fall 1999.
[15] S. Tsumoto, Statistical Test for Rough Set Approximation Based on Fisher's Exact Test Proc. Conf. Rough Sets and Current Trends in Computing (RSCTC '02), pp. 381-388, 2002.
[16] S. Wrobel, An Algorithm for Multi-Relational Discovery of Subgroups Proc. First European Symp. Principles of Data Mining and Knowledge Discovery (PKDD '97), pp. 367-375, 1997.
[17] J. Wu and N. Zhong, An Investigation on Human Multi-Perception Mechanism by Cooperatively Using Psychometrics and Data Mining Techniques Proc. Fifth World Multi-Conf. Systemics, Cybernetics, and Informatics (SCI '01), vol. X, pp. 285-290, 2001.
[18] Y.Y. Yao, Granular Computing using Neighborhood Systems Advances in Soft Computing: Eng. Design and Manufacturing, R. Roy, T. Furuhashi, and P.K. Chawdhry, eds., pp. 539-553, Springer, 1999.
[19] Y.Y. Yao and N. Zhong, An Analysis of Quantitative Measures Associated with Rules Proc. Third Pacific-Asia Conf. Knowledge Discovery and Data Mining (PAKDD '99), pp. 479-488, 1999.
[20] H. Yokoi, S. Hirano, K. Takabayashi, S. Tsumoto, and Y. Satomura, Active Mining in Medicine: A Chronic Hepatitis Case Towards Knowledge Discovery in Hospital Information Systems J. Japanese Soc. Artificial Intelligence, vol. 17, no. 5, pp. 622-628, 2002.
[21] L.A. Zadeh, Toward a Theory of Fuzzy Information Granulation and Its Centrality in Human Reasoning and Fuzzy Logic Fuzzy Sets and Systems, vol. 90, pp. 111-127, 1997.
[22] R. Zembowicz and J.M. Zytkow, From Contingency Tables to Various Forms of Knowledge in Databases Advances in Knowledge Discovery and Data Mining, U.M. Fayyad, G. Piatetsky-Shapiro, P. Smyth, and R. Uthurusamy, eds., pp. 329-349, AAAI/MIT Press, 1996.
[23] N. Zhong and S. Ohsuga, Discovering Concept Clusters by Decomposing Databases Data Knowledge Eng., vol. 12, no. 2, pp. 223-244, 1994.
[24] N. Zhong and S. Ohsuga, KOSI An Integrated System for Discovering Functional Relations from Databases J. Intelligent Information Systems, vol. 5, no. 1, pp. 25-50, 1995.
[25] N. Zhong, Y.Y. Yao, and S. Ohsuga, Peculiarity Oriented Multi-Database Mining Proc. Third European Symp. Principles of Data Mining and Knowledge Discovery (PKDD '99), pp. 136-146, 1999.
[26] N. Zhong, M. Ohshima, and S. Ohsuga, Peculiarity Oriented Mining and Its Application for Knowledge Discovery in Amino-acid Data Proc. Fifth Pacific- Asia Conf. Knowledge Discovery and Data Mining (PAKDD '01), pp. 260-269, 2001.
[27] N. Zhong, Y.Y. Yao, M. Ohshima, and S. Ohsuga, Interestingness, Peculiarity, and Multi-Database Mining Proc. IEEE Int'l Conf. Data Mining (ICDM '01), pp. 566-573 2001.
[28] N. Zhong, A. Nakamaru, M. Ohshima, J.L. Wu, and H. Mizuhara, Peculiarity Oriented Mining in Multiple Human Brain Data Proc. 2003 Int'l Conf. Intelligent Data Eng. and Automated Learning (IDEAL '03), 2003.

Index Terms:
Peculiarity oriented mining, interestingness, multidatabase mining.
Ning Zhong, Yiyu (Y.Y.) Yao, Muneaki Ohshima, "Peculiarity Oriented Multidatabase Mining," IEEE Transactions on Knowledge and Data Engineering, vol. 15, no. 4, pp. 952-960, July-Aug. 2003, doi:10.1109/TKDE.2003.1209011
Usage of this product signifies your acceptance of the Terms of Use.