DocumentCode :
3215369
Title :
A parallel algorithm based on search space partition for generating concepts
Author :
Qi, Hong ; Liu, Dayou ; Hu, Chengquan ; Lu, Ming ; Zhao, Liang
Author_Institution :
Coll. of Comput. Sci. & Technol., Jilin Univ., Changchun, China
fYear :
2004
fDate :
7-9 July 2004
Firstpage :
241
Lastpage :
248
Abstract :
Concept lattice, the core data structure in formal concept analysis, has been used widely in machine learning, data mining and knowledge discovery, information retrieval, etc. The main difficulty with concept lattice-based system comes from the lattice construction itself. In this paper, a parallel algorithm based on the closure search space partition for computing concepts is proposed. This algorithm divides the closure search space into several subspaces in accordance with criterions prescribed ahead and introduces an efficient scheme to recognize the valid ones, in which the searching for closures is bounded. An intermediate structure is employed to judge the validity of a subspace and compute closures more efficiently. Since the searching in subspaces are independent tasks, a parallel algorithm based on search space partition can be directly reached.
Keywords :
data structures; formal specification; lattice theory; parallel algorithms; search problems; closure search space partition; concept generation; concept lattice; core data structure; formal concept analysis; lattice construction; parallel algorithm; Concurrent computing; Data mining; Data structures; Information analysis; Information retrieval; Lattices; Machine learning; Machine learning algorithms; Parallel algorithms; Partitioning algorithms;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Parallel and Distributed Systems, 2004. ICPADS 2004. Proceedings. Tenth International Conference on
ISSN :
1521-9097
Print_ISBN :
0-7695-2152-5
Type :
conf
DOI :
10.1109/ICPADS.2004.1316101
Filename :
1316101
Link To Document :
بازگشت