Galois connections and data mining

Journal of Universal Computer Science

Volumn 6, Issue 1, 2000, Pages 60-73

  Cristofor, Dana ^a   Cristofor, Laurentiu ^a   Simovici, Dan A ^a  

^a UNIVERSITY OF MASSACHUSETTS BOSTON   (United States)

Author keywords

Closure; Extended closure; Frequent set of items; Galois connection; Support

Indexed keywords

EID: 6344232698     PISSN: 0948695X     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (7)

1. Agrawal R., Imielinski T., Swami A.:Mining Association rules between Sets of Items in Large Databases, SIGMOD 1993, pages 207-216.
2. Agrawal R., Srikant R.:Fast Algorithms for mining association rules, VLDB 1994.
3. Bayardo R. J.:Efficiently Mining Long Patterns from Databases, SIGMOD 1998, pages 85-93.
4. Birkhoff G.:Lattice Theory, American Mathematical Society, Colloquium Publications, 3rd edition, 1973.
5. Gierz G. et al.:A Compendium of Continuous Lattices, Springer-Verlag, Berlin, 1980.
6. Gunopulos D., Khardon R., Mannila H., Toivonen H.:Data mining, Hypergraph Transversals, and Machine Learning, PODS 1997, pages 209-216.
7. Mueller A.:Fast Sequential and Parallel Algorithms for Association Rule Mining: A Comparison, CS-TR-3515, University of Maryland-College Park, 1995.