Mining class-bridge rules based on rough sets

Expert Systems with Applications

Volumn 36, Issue 3 PART 2, 2009, Pages 6453-6460

  Zhang, Shichao ^a,b   Chen, Feng ^c   Jin, Zhi ^d   Wang, Ruili ^e  

^a GUANGXI NORMAL UNIVERSITY   (China)

^b UNIVERSITY OF TECHNOLOGY SYDNEY   (Australia)

^c DEAKIN UNIVERSITY   (Australia)

^d PEKING UNIVERSITY   (China)

^e MASSEY UNIVERSITY   (New Zealand)

Author keywords

Association rules; Class bridge rules; Information entropy; Rough sets

Indexed keywords

ASSOCIATION RULES; CHEMICAL DETECTION; GRAFTING (CHEMICAL);

CLASS-BRIDGE RULES; INFORMATION ENTROPY; ITEM SETS; MEASUREMENTS OF;

ROUGH SET THEORY;

EID: 58349114840     PISSN: 09574174     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.eswa.2008.07.044     Document Type: Article

References (20)

1. Arning, A., Agrawal, R., & Raghavan, P. (1996). A linear method for deviation detection in large databases. In Proceedings of the 1996 international conference knowledge discovery and data mining (pp. 164-169). Portland, Oregon, August.
2. Barnett V., and Lewis T. Outliers in statistical data (1994), John Wiley & Sons
3. Bay S., and Pazzani M. Detecting group differences: Mining contrast sets. Data Mining and Knowledge Discovery 5 3 (2001) 213-246
4. Breunig, Markus M., Kriegel, Hans-Peter., Ng, Raymond T., et al. (2000). Identifying density-based local outliers. In Proceedings of the ACM SIGMOD 2000 international conference on management of data. Daller, TX.
5. Brin, S., Motwani, R., & Silverstein, C. (1997). Beyond market baskets: Generalizing association rules to correlations. In Proceedings of ACM SIGMOD international conference on management of data (pp. 265-276).
6. Edwin, M., & Raymond, T. (1998). Algorithms for mining distance-based outlier in large datasets. In Proceedings of the 24th international conference on very large databases (pp. 392-403).
7. Han J., and Kamber M. Data mining: Concepts and techniques (2000), Morgan Kaufman
8. Johnson, T., Kwok, I., & Ng, R.T. (1998). Fast computation of 2-dimensional depth contours. In Proceedings of the KDD 1998 (pp. 224-228).
9. Karypis G., Han E., and Kumar V. CHAMELEON: A hierarchical clustering algorithm using dynamic modeling. IEEE Computer (1999) 68-75
10. Korn, F., & Muthukrishnan, S. (2000). Influence sets based on reverse nearest neighbor queries. In SIGMOD00 (pp. 201-212).
11. Liu, H., Lu, H., Feng, L., & Hussain, F. (1999). Efficient search of reliable exceptions. In Proceedings of PAKDD99 (pp. 194-204).
12. Liu, B., Hsu, W., Han, H., & Xia, Y. (2000). Mining changes for real-life applications. In Second international conference on data warehousing and knowledge discovery (pp. 337-346).
13. Liu B., Hsu W., Mun L., and Lee H. Finding interesting patterns using user expectations. IEEE Transactions on Knowledge and Data Engineering 11 6 (1999) 817-832
14. Padmanabhan, B., Tuzhilin, A. (1998). A belief-driven method for discovering unexpected patterns. In Proceedings of ACM SIGKDD98 (pp. 94-100).
15. Qin Z., and Chen F. Discovering class-bridge rules within conceptual classes. Asian Journal of Information Technology 5 2 (2006) 169-171
16. Sarawagi, S., Agrawal, R., & Megiddo, N. (1998). Discovery riven exploration of OLAP data cubes. In Proceedings of the sixth international conference on extending database technology. Valencia, Spain, March.
17. Wu, X., Zhang, C., & Zhang, S. (2002). Mining both positive and negative association rules. In ICML02 (pp. 658-665). Sydney, Australia.
18. Zeng, L. (1998). Rough set theory and its applications - the methods of data deductions. The Chongqing University Press.
19. Zhang S., Chen F., Wu X., and Zhang C. Identifying bridging rules between conceptual clusters. KDD (2006) 815-820
20. Zhang S., Chen F., and You X. Mining the correction among classes. Computer Science 32 10 (2005) 128-131