A parallel algorithm for lattice construction

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 3403, Issue , 2005, Pages 249-264

  Kengue, Jean François Djoufak ^a   Valtchev, Petko ^b   Djamegni, Clémentin Tayou ^c  

^a UNIVERSITY OF YAOUNDÉ I   (Cameroon)

^b UNIVERSITÉ DE MONTRÉAL   (Canada)

^c UNIVERSITÉ DE DSCHANG   (Cameroon)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER ARCHITECTURE; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SCIENCE; DATA MINING; DATA PROCESSING;

DATA SLICING; DIVIDE-AND-CONQUER (D&C) APPROACH; FORMAL CONCEPT ANALYSIS (FCA); SEQUENTIAL ALGORITHM;

PARALLEL ALGORITHMS;

EID: 26844508148     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-32262-7_17     Document Type: Conference Paper

References (19)

1. Bordat, J.P.: Calcul pratique du treillis de Galois d'une correspondance. Mathématiques et Sciences Humaines, Vol. 96 (1986) 31-47
2. Foster, I.: Designing and Building Parallel Program. Addison Wesley (1995)
3. Fu, H., Mephu Nguifo, E.: A Parallel Algorithm to Generate Formal Concepts for Large Data. In Proc. of the Second International Conference on Formal Concept Analysis (ICFCA04), Springer LNCS, Sydney Australia (2004)
4. Ganter, B.: Two basic algorithms in concept analysis. Preprint 831, Technische Hochschule, Darmstadt (1984)
5. Ganter, B, Wille, R.: Formal Concept Analysis, Mathematical Foundations. Springer-Verlag (1999)
6. Gropp, W., Lusk, E., Skjellum, A.: Using MPI: Portable parallel programming with the Message Passing Interface. Cambridge, Mass.: MIT Press (1994)
7. Guigues, J.L., Duquenne, V: Familles minimales d'implications informatives résultant d'un tableau de données binaires. Mathématiques et Sciences Sociales, Vol. 95 (1986) 5-18
8. LAM/MPI Team: LAM/MPI User Guide, version 7.0.4. Pervasive Technology labs, Indiana University (2004)
9. MPICH home page: http://www.mpich.org. (2004)
10. Ndoundam, R., Njiwoua, P., Mephu Nguifo, E.: Une étude comparative de la parallélisation d'algorithmes de construction de treillis de Galois. Atelier francophone de la plate forme de 1'APIA: Usage des treillis de Galois pour l'intelligence artificielle, ESIEA Recherche (2003)
11. Njiwoua, P., Mephu Nguifo, E.: A Parallel Algorithm to build Concept Lattice. In proc. of the 4th Groningen Int. Information Tech. Conf. for students (1997)
12. Nourine, L., Raynaud, O.: A Fast Algorithm for Building Lattices. Information Processing Letters, Vol. 71 (1999) 199-204
13. Robson, R.: Using the STL: The C++ Standard Template Library, 2nd Edition. New York Springer (2000)
14. Tayou Djamegni, C.: Mapping Rectangular Mesh Algorithm on to Asymptotically Space-Optimal Arrays. Journal of Parallel and Distributed Computing, Vol. 64 3 (2004) 345-359
15. Tayou Djamegni, C., Tchuenté, M.: A cost-optimal pipeline algorithm for permutation generation in lexicographic order. Journal of Parallel and Distributed Computing, Vol. 44 (1997) 153-159.
16. Tchuenté, M.: Parallel computation on rectangular arrays. Manchester University Press, Manchester and Willey, NY, USA (1992)
17. Valtchev, P., Missaoui, R., Lebrun, P.: A partition-based approach towards building Galois (concept) lattices. Discrete Mathematics, Vol. 256. 3 (2002) 801-829
18. Valtchev, P., Duquenne, V: Towards scalable divide-and-conquer methods for computing concepts and implications. Preprint submitted to Discrete Applied Mathematics (2004)
19. Wille, R.: Restructuring lattice theory: An approach based on hierarchies of concepts. In I. Rival, editor, Ordered sets, Dordrecht-Boston (1982) 445-470