From intent reducts for attribute implications to approximate intent reducts for association rules

Proceedings - Fifth International Conference on Computer and Information Technology, CIT 2005

Volumn 2005, Issue , 2005, Pages 162-169

  Xie, Zhipeng ^a   Liu, Zongtian ^b  

^a FUDAN UNIVERSITY   (China)

^b SHANGHAI UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTER SCIENCE; DATA ACQUISITION; KNOWLEDGE ACQUISITION; NUMERICAL METHODS;

ASSOCIATION RULES; ATTRIBUTE IMPLICATIONS; CONCEPT LATTICE; INTENT REDUCTS;

DATA MINING;

EID: 33746864901     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (7)

1. R. Agrawl, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. In: Proc. ACM SIGMOD International Conference on Management of Data, Washington D.C., May 1993. pp 207-216
2. B. Ganter, R. Wille. Formal Concept Analysis: Mathematical Foundations. Springer-Verlag, Berlin, 1999
3. C. Lindig, G. Snelting. Assessing modular structure of legacy code based on mathematical concept analysis. In: Proc. International Conference on Software Engineering, Boston, USA, May 1997. pp. 349-359
4. D. Maier. The Theory of Relational Databases. Computer Science Press, Rockville, 1983
5. R. Wille. Restructuring lattice theory: an approach based on hierarchies of concepts. In I. Rival (Eds.), Ordered Sets, Reidel, Dordrecht, 1982. pp. 445-470
6. Z. Xie, Z. Liu. Concept lattice and association rule discovery. Computer Research and Development, 2000, 37(12):1415-1421 (in Chinese)
7. Z. Xie, Z. Liu. Intent reduct of concept lattice node and its computing. Computer Enginnering, 2001, 27(3): 9-11 (in Chinese)