Author | Title | Year | Journal/Proceedings | Reftype | DOI/URL |
---|---|---|---|---|---|

Pasquier, N., Taouil, R., Bastide, Y., Stumme, G. & Lakhal, L. | Generating a Condensed Representation for Association Rules [BibTeX] |
2005 | Journal Intelligent Information Systems (JIIS) | article | URL |

BibTeX:
@article{pasquier2005generating, author = {Pasquier, Nicolas and Taouil, Rafik and Bastide, Yves and Stumme, Gerd and Lakhal, Lotfi}, title = {Generating a Condensed Representation for Association Rules}, journal = {Journal Intelligent Information Systems (JIIS)}, publisher = {Kluwer Academic Publishers}, year = {2005}, volume = {24}, number = {1}, pages = {29-60}, url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2005/pasquier2005generating.pdf} } |
|||||

Pasquier, N., Taouil, R., Bastide, Y., Stumme, G. & Lakhal, L. | Generating a Condensed Representation for Association Rules [BibTeX] |
2005 | Journal Intelligent Information Systems (JIIS) | article | URL |

BibTeX:
@article{pasquier2005generating, author = {Pasquier, Nicolas and Taouil, Rafik and Bastide, Yves and Stumme, Gerd and Lakhal, Lotfi}, title = {Generating a Condensed Representation for Association Rules}, journal = {Journal Intelligent Information Systems (JIIS)}, publisher = {Kluwer Academic Publishers}, year = {2005}, volume = {24}, number = {1}, pages = {29-60}, url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2005/pasquier2005generating.pdf} } |
|||||

Stumme, G., Taouil, R., Bastide, Y., Pasquier, N. & Lakhal, L. | Computing iceberg concept lattices with TITANIC | 2002 | Data & Knowledge Engineering | article | DOIURL |

Abstract: We introduce the notion of iceberg concept lattices and show their use in knowledge discovery in databases. Iceberg lattices are a conceptual clustering method, which is well suited for analyzing very large databases. They also serve as a condensed representation of frequent itemsets, as starting point for computing bases of association rules, and as a visualization method for association rules. Iceberg concept lattices are based on the theory of Formal Concept Analysis, a mathematical theory with applications in data analysis, information retrieval, and knowledge discovery. We present a new algorithm called TITANIC for computing (iceberg) concept lattices. It is based on data mining techniques with a level-wise approach. In fact, TITANIC can be used for a more general problem: Computing arbitrary closure systems when the closure operator comes along with a so-called weight function. The use of weight functions for computing closure systems has not been discussed in the literature up to now. Applications providing such a weight function include association rule mining, functional dependencies in databases, conceptual clustering, and ontology engineering. The algorithm is experimentally evaluated and compared with Ganter's Next-Closure algorithm. The evaluation shows an important gain in efficiency, especially for weakly correlated data. |
|||||

BibTeX:
@article{stumme2002computing, author = {Stumme, Gerd and Taouil, Rafik and Bastide, Yves and Pasquier, Nicolas and Lakhal, Lotfi}, title = {Computing iceberg concept lattices with TITANIC}, journal = {Data & Knowledge Engineering}, publisher = {Elsevier Science Publishers B. V.}, year = {2002}, volume = {42}, number = {2}, pages = {189--222}, url = {http://portal.acm.org/citation.cfm?id=606457}, doi = {http://dx.doi.org/10.1016/S0169-023X(02)00057-5} } |
|||||

Stumme, G., Taouil, R., Bastide, Y., Pasquier, N. & Lakhal, L. | Computing iceberg concept lattices with TITANIC | 2002 | Data & Knowledge Engineering | article | DOIURL |

Abstract: We introduce the notion of iceberg concept lattices and show their use in knowledge discovery in databases. Iceberg lattices are a conceptual clustering method, which is well suited for analyzing very large databases. They also serve as a condensed representation of frequent itemsets, as starting point for computing bases of association rules, and as a visualization method for association rules. Iceberg concept lattices are based on the theory of Formal Concept Analysis, a mathematical theory with applications in data analysis, information retrieval, and knowledge discovery. We present a new algorithm called TITANIC for computing (iceberg) concept lattices. It is based on data mining techniques with a level-wise approach. In fact, TITANIC can be used for a more general problem: Computing arbitrary closure systems when the closure operator comes along with a so-called weight function. The use of weight functions for computing closure systems has not been discussed in the literature up to now. Applications providing such a weight function include association rule mining, functional dependencies in databases, conceptual clustering, and ontology engineering. The algorithm is experimentally evaluated and compared with Ganter's Next-Closure algorithm. The evaluation shows an important gain in efficiency, especially for weakly correlated data. |
|||||

BibTeX:
@article{stumme2002computing, author = {Stumme, Gerd and Taouil, Rafik and Bastide, Yves and Pasquier, Nicolas and Lakhal, Lotfi}, title = {Computing iceberg concept lattices with TITANIC}, journal = {Data \& Knowledge Engineering}, publisher = {Elsevier Science Publishers B. V.}, year = {2002}, volume = {42}, number = {2}, pages = {189--222}, url = {http://portal.acm.org/citation.cfm?id=606457}, doi = {http://dx.doi.org/10.1016/S0169-023X(02)00057-5} } |
|||||

Pasquier, N., Bastide, Y., Taouil, R. & Lakhal, L. | Pruning closed itemset lattices for associations rules. [BibTeX] |
1998 | Bases de Donn�es Avanc�es | inproceedings | URL |

BibTeX:
@inproceedings{pasquier98pruning, author = {Pasquier, Nicolas and Bastide, Yves and Taouil, Rafik and Lakhal, Lotfi}, title = {Pruning closed itemset lattices for associations rules.}, booktitle = {Bases de Donn�es Avanc�es}, year = {1998}, url = {http://dblp.uni-trier.de/db/conf/bda/bda98.html#PasquierBTL98} } |
|||||

Pasquier, N., Bastide, Y., Taouil, R. & Lakhal, L. | Pruning closed itemset lattices for associations rules. [BibTeX] |
1998 | Bases de Données Avancées | inproceedings | URL |

BibTeX:
@inproceedings{pasquier98pruning, author = {Pasquier, Nicolas and Bastide, Yves and Taouil, Rafik and Lakhal, Lotfi}, title = {Pruning closed itemset lattices for associations rules.}, booktitle = {Bases de Données Avancées}, year = {1998}, url = {http://dblp.uni-trier.de/db/conf/bda/bda98.html#PasquierBTL98} } |

Created by JabRef export filters on 17/06/2019 by the social publication management platform PUMA