Petko Valtchev, Rokia Missaoui, Pierre Lebrun  Home/Search
Context Related
| iro.umontreal.ca/%...ppositionDM.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: iro.umontreal.c...valtchev_papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Galois lattices and formal concept analysis of binary relations have proved useful in the resolution of many problems of theoretical or practical interest. Recent studies of practical applications in data mining and software engineering have put the emphasis on the need for both efficient and flexible algorithms to construct the lattice. Our paper presents a novel approach for lattice construction based on the apposition of binary relation fragments. We extend the existing theory to a... (Update)
Similar documents based on text: More All
0.7: A Fast Algorithm for Building the Hasse Diagram of a.. - Valtchev, Missaoui.. (2000) (Correct)
0.5: Similarity-based Clustering versus Galois lattice building: .. - Valtchev, Missaoui (Correct)
0.4: A Framework for Incremental Generation of Frequent Closed.. - Valtchev, Missaoui, Godin (2002) (Correct)
BibTeX entry: (Update)
P. Valtchev, R. Missaoui, and P. Lebrun. A partition-based approach towards constructing galois (concept) lattices. Discrete Mathematics, 256(3):801--829, 2002. http://citeseer.ist.psu.edu/valtchev02partitionbased.html More
@misc{ valtchev02partitionbased,
author = "P. Valtchev and R. Missaoui and P. Lebrun",
title = "A partition-based approach towards constructing galois",
text = "P. Valtchev, R. Missaoui, and P. Lebrun. A partition-based approach towards
constructing galois (concept) lattices. Discrete Mathematics, 256(3):801--829,
2002.",
year = "2002",
url = "citeseer.ist.psu.edu/valtchev02partitionbased.html" }
Citations (may not include all citations):509 Introduction to lattices and order (context) - Davey, Priestley - 1992
152 Restructuring the lattice theory: An approach based on hiera.. (context) - Wille - 1982
49 Formal Concept Analysis (context) - Ganter, Wille - 1999
44 Incremental concept formation algorithms based on galois - Godin, Missaoui et al. - 1995
43 Reengineering class hierarchies using concept analysis - Snelting, Tip - 1998
39 IEEE Transactions on Knowledge and Data Engineering (context) - Zaki, Ho et al. - 2000
35 American Mathematical Society Colloquium Publ (context) - Birkhoff, volume - 1973
25 Calcul pratique du treillis de Galois d'une correspondance (context) - Bordat - 1986
23 Two basic algorithms in concept analysis (context) - Ganter - 1984
22 Automatic Structuring of Knowledge Bases by Conceptual Clust.. - Mineau, Godin - 1995
17 A Fast Algorithm for Building Lattices (context) - Nourine, Raynaud - 1999
16 Efficient Mining of Association Rules Using Closed Itemset L.. - Pasquier, Bastide et al. - 1999
11 Design of class hierarchies based on concept (context) - Godin, Mili et al. - 1998
11 Lattices in data analysis: how to draw them with a computer (context) - Wille - 1989
7 An algorithm for computing the maximal rectangles in a binar.. (context) - Norris - 1978
[Article contains additional citations not shown here]
Documents on the same site (http://www.iro.umontreal.ca/%7Evaltchev/valtchev_papers.html): More
Similarity-based Clustering versus Galois lattice building: .. - Valtchev, Missaoui (Correct)
Extracting Formal Concepts out of Relational Data - Valtchev, Hacene, Huchard.. (2003) (Correct)
Building Classes in Object-Based Languages by Automatic Clustering - Valtchev (1999) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC