%0 Book Section %1 springerlink:10.1007/978-3-540-24651-0_33 %A Fu, Huaiguo %A Nguifo, Engelbert %B Concept Lattices %D 2004 %E Eklund, Peter %I Springer Berlin / Heidelberg %K FBA Begriffsverband %P 141-142 %T A Parallel Algorithm to Generate Formal Concepts for Large Data %U http://dx.doi.org/10.1007/978-3-540-24651-0_33 %V 2961 %X One of the most effective methods to deal with large data for data analysis and data mining is to develop parallel algorithm. Although Formal concept analysis is an effective tool for data analysis and knowledge discovery, it's very hard for concept lattice structures to face the complexity of very large data. So we propose a new parallel algorithm based on the NextClosure algorithm to generate formal concepts for large data.

@incollection{springerlink:10.1007/978-3-540-24651-0_33, abstract = {One of the most effective methods to deal with large data for data analysis and data mining is to develop parallel algorithm. Although Formal concept analysis is an effective tool for data analysis and knowledge discovery, it's very hard for concept lattice structures to face the complexity of very large data. So we propose a new parallel algorithm based on the NextClosure algorithm to generate formal concepts for large data.}, added-at = {2012-02-16T17:11:40.000+0100}, affiliation = {CRIL-CNRS FRE2499, Universit{\'e} d'Artois -- IUT de Lens, Rue de l'universit{\'e} SP 16, 62307 Lens cedex, France}, author = {Fu, Huaiguo and Nguifo, Engelbert}, bdsk-file-1 = {YnBsaXN0MDDUAQIDBAUGCQpYJHZlcnNpb25UJHRvcFkkYXJjaGl2ZXJYJG9iamVjdHMSAAGGoNEHCFRyb290gAFfEA9OU0tleWVkQXJjaGl2ZXKoCwwXGBkdJCVVJG51bGzTDQ4PEBEUViRjbGFzc1dOUy5rZXlzWk5TLm9iamVjdHOAB6ISE4ACgAOiFRaABIAGWWFsaWFzRGF0YVxyZWxhdGl2ZVBhdGjSDRobHFdOUy5kYXRhgAVPEQIYAAAAAAIYAAIAAAxNYWNpbnRvc2ggSEQAAAAAAAAAAAAAAAAAAADCWLRVSCsAAAIDs2gfQSBQYXJhbGxlbCBBbGdvcml0aCMyMDNBMTU5LnBkZgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAgOhWcpgiJkAAAAAAAAAAAABAAQAAAkgAAAAAAAAAAAAAAAAAAAAAkZ1ABAACAAAwliYNQAAABEACAAAymBseQAAAAEAFAIDs2gAIBUvAAfz5wAH89oAAHBCAAIAT01hY2ludG9zaCBIRDpVc2VyczpzY2hsZW1tZTpEb2N1bWVudHM6UGFwZXJzOkZ1OkEgUGFyYWxsZWwgQWxnb3JpdGgjMjAzQTE1OS5wZGYAAA4AagA0AEEAIABQAGEAcgBhAGwAbABlAGwAIABBAGwAZwBvAHIAaQB0AGgAbQAgAHQAbwAgAEcAZQBuAGUAcgBhAHQAZQAgAEYAbwByAG0AYQBsACAAQwBvAG4AYwBlAHAAdABzAC4AcABkAGYADwAaAAwATQBhAGMAaQBuAHQAbwBzAGgAIABIAEQAEgBXVXNlcnMvc2NobGVtbWUvRG9jdW1lbnRzL1BhcGVycy9GdS9BIFBhcmFsbGVsIEFsZ29yaXRobSB0byBHZW5lcmF0ZSBGb3JtYWwgQ29uY2VwdHMucGRmAAATAAEvAAAVAAIAD///AADSHh8gIVgkY2xhc3Nlc1okY2xhc3NuYW1loyEiI11OU011dGFibGVEYXRhVk5TRGF0YVhOU09iamVjdF8QPlBhcGVycy9GdS9BIFBhcmFsbGVsIEFsZ29yaXRobSB0byBHZW5lcmF0ZSBGb3JtYWwgQ29uY2VwdHMucGRm0h4fJieiJyNcTlNEaWN0aW9uYXJ5AAgAEQAaAB8AKQAyADcAOgA/AEEAUwBcAGIAaQBwAHgAgwCFAIgAigCMAI8AkQCTAJ0AqgCvALcAuQLVAtoC4wLuAvIDAAMHAxADUQNWA1kAAAAAAAACAQAAAAAAAAAoAAAAAAAAAAAAAAAAAAADZg==}, bdsk-url-1 = {http://dx.doi.org/10.1007/978-3-540-24651-0_33}, biburl = {https://www.bibsonomy.org/bibtex/20eda770560fc6179aff5c831144759a3/keinstein}, booktitle = {Concept Lattices}, date-added = {2011-08-04 18:24:51 +0200}, date-modified = {2011-08-04 18:27:33 +0200}, editor = {Eklund, Peter}, file = {:Fu/A Parallel Algorithm to Generate Formal Concepts.pdf:PDF}, groups = {public}, interhash = {ac37e6ecf29f7d69ed590868cc3b88e9}, intrahash = {0eda770560fc6179aff5c831144759a3}, keywords = {FBA Begriffsverband}, note = {10.1007/978-3-540-24651-0_33}, pages = {141-142}, publisher = {Springer Berlin / Heidelberg}, series = {Lecture Notes in Computer Science}, timestamp = {2013-01-29T14:35:35.000+0100}, title = {A Parallel Algorithm to Generate Formal Concepts for Large Data}, url = {http://dx.doi.org/10.1007/978-3-540-24651-0_33}, username = {keinstein}, volume = 2961, year = 2004 }