Knowledge Discovery from Very Large Databases Using Frequent Concept Lattices
Abstract
Data clustering and association rules discovery are two related problems in data mining. In this paper, we propose to integrate these two techniques using the frequent concept lattice data structure — a formal conceptual model that can be used to identify similarities among a set of objects based on their frequent attributes (frequent items). Experimental results show that clusterings and association rules are generated efficiently from the frequent concept lattice, since response time after lattice construction is measured almost in seconds.
Cite
Text
Waiyamai and Lakhal. "Knowledge Discovery from Very Large Databases Using Frequent Concept Lattices." European Conference on Machine Learning, 2000. doi:10.1007/3-540-45164-1_44Markdown
[Waiyamai and Lakhal. "Knowledge Discovery from Very Large Databases Using Frequent Concept Lattices." European Conference on Machine Learning, 2000.](https://mlanthology.org/ecmlpkdd/2000/waiyamai2000ecml-knowledge/) doi:10.1007/3-540-45164-1_44BibTeX
@inproceedings{waiyamai2000ecml-knowledge,
title = {{Knowledge Discovery from Very Large Databases Using Frequent Concept Lattices}},
author = {Waiyamai, Kitsana and Lakhal, Lotfi},
booktitle = {European Conference on Machine Learning},
year = {2000},
pages = {437-445},
doi = {10.1007/3-540-45164-1_44},
url = {https://mlanthology.org/ecmlpkdd/2000/waiyamai2000ecml-knowledge/}
}