%0 Book Section %1 springerlink:10.1007/11790853_15 %A Ji-Fu, Zhang %A Li-Hua, Hu %A Su-Lan, Zhang %B Advances in Data Mining. Applications in Medicine, Web Mining, Marketing, Image and Signal Mining %D 2006 %E Perner, Petra %I Springer Berlin / Heidelberg %K FCA Algorithmen %P 191-201 %T A Pruning Based Incremental Construction Algorithm of Concept Lattice %U http://dx.doi.org/10.1007/11790853_15 %V 4065 %X The concept lattice has played an important role in knowledge discovery. However due to inevitable occurrence of redundant information in the construction process of concept lattice, the low construction efficiency has been a main concern in the literature. In this work, an improved incremental construction algorithm of concept lattice over the traditional Godin algorithm, called the pruning based incremental algorithm is proposed, which uses a pruning process to detect and eliminate possible redundant information during the construction. Our pruning based construction algorithm is in nature superior to the Godin algorithm. It can achieve the same structure with the Godin algorithm but with less computational complexity. In addition, our pruning based algorithm is also experimentally validated by taking the star spectra from the LAMOST project as the formal context.

@incollection{springerlink:10.1007/11790853_15, abstract = {The concept lattice has played an important role in knowledge discovery. However due to inevitable occurrence of redundant information in the construction process of concept lattice, the low construction efficiency has been a main concern in the literature. In this work, an improved incremental construction algorithm of concept lattice over the traditional Godin algorithm, called the pruning based incremental algorithm is proposed, which uses a pruning process to detect and eliminate possible redundant information during the construction. Our pruning based construction algorithm is in nature superior to the Godin algorithm. It can achieve the same structure with the Godin algorithm but with less computational complexity. In addition, our pruning based algorithm is also experimentally validated by taking the star spectra from the LAMOST project as the formal context.}, added-at = {2012-02-16T17:11:41.000+0100}, affiliation = {School of Computer Science and Technology, Tai-Yuan University of Science, and Technology, Tai-Yuan, 030024 P.R. China}, author = {Ji-Fu, Zhang and Li-Hua, Hu and Su-Lan, Zhang}, bdsk-file-1 = {YnBsaXN0MDDUAQIDBAUGCQpYJHZlcnNpb25UJHRvcFkkYXJjaGl2ZXJYJG9iamVjdHMSAAGGoNEHCFRyb290gAFfEA9OU0tleWVkQXJjaGl2ZXKoCwwXGBkdJCVVJG51bGzTDQ4PEBEUViRjbGFzc1dOUy5rZXlzWk5TLm9iamVjdHOAB6ISE4ACgAOiFRaABIAGWWFsaWFzRGF0YVxyZWxhdGl2ZVBhdGjSDRobHFdOUy5kYXRhgAVPEQImAAAAAAImAAIAAAxNYWNpbnRvc2ggSEQAAAAAAAAAAAAAAAAAAADCWLRVSCsAAAHjDmQfQSBQcnVuaW5nIEJhc2VkIEluYyMxOEUyMjJBLnBkZgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAY4iKsj95NMAAAAAAAAAAAABAAQAAAkgAAAAAAAAAAAAAAAAAAAABUppLUZ1AAAQAAgAAMJYmDUAAAARAAgAAMj91sMAAAABABQB4w5kACAVLwAH8+cAB/PaAABwQgACAFJNYWNpbnRvc2ggSEQ6VXNlcnM6c2NobGVtbWU6RG9jdW1lbnRzOlBhcGVyczpKaS1GdTpBIFBydW5pbmcgQmFzZWQgSW5jIzE4RTIyMkEucGRmAA4AbgA2AEEAIABQAHIAdQBuAGkAbgBnACAAQgBhAHMAZQBkACAASQBuAGMAcgBlAG0AZQBuAHQAYQBsACAAQwBvAG4AcwB0AHIAdQBjAHQAaQBvAG4AIABBAGwAZwBvAHIAaQB0AGgAbQAuAHAAZABmAA8AGgAMAE0AYQBjAGkAbgB0AG8AcwBoACAASABEABIAXFVzZXJzL3NjaGxlbW1lL0RvY3VtZW50cy9QYXBlcnMvSmktRnUvQSBQcnVuaW5nIEJhc2VkIEluY3JlbWVudGFsIENvbnN0cnVjdGlvbiBBbGdvcml0aG0ucGRmABMAAS8AABUAAgAP//8AANIeHyAhWCRjbGFzc2VzWiRjbGFzc25hbWWjISIjXU5TTXV0YWJsZURhdGFWTlNEYXRhWE5TT2JqZWN0XxBDUGFwZXJzL0ppLUZ1L0EgUHJ1bmluZyBCYXNlZCBJbmNyZW1lbnRhbCBDb25zdHJ1Y3Rpb24gQWxnb3JpdGhtLnBkZtIeHyYnoicjXE5TRGljdGlvbmFyeQAIABEAGgAfACkAMgA3ADoAPwBBAFMAXABiAGkAcAB4AIMAhQCIAIoAjACPAJEAkwCdAKoArwC3ALkC4wLoAvEC/AMAAw4DFQMeA2QDaQNsAAAAAAAAAgEAAAAAAAAAKAAAAAAAAAAAAAAAAAAAA3k=}, bdsk-url-1 = {http://dx.doi.org/10.1007/11790853_15}, biburl = {https://www.bibsonomy.org/bibtex/2f633d97b27147cffb16fdb8613b0326a/keinstein}, booktitle = {Advances in Data Mining. Applications in Medicine, Web Mining, Marketing, Image and Signal Mining}, date-added = {2011-04-26 11:34:13 +0200}, date-modified = {2011-04-26 11:34:30 +0200}, editor = {Perner, Petra}, file = {:Ji-Fu/A Pruning Based Incremental Construction Algorithm.pdf:PDF}, groups = {public}, interhash = {0a5563c6b655f2bf9b2699ce4862836c}, intrahash = {f633d97b27147cffb16fdb8613b0326a}, keywords = {FCA Algorithmen}, note = {10.1007/11790853_15}, pages = {191-201}, publisher = {Springer Berlin / Heidelberg}, series = {Lecture Notes in Computer Science}, timestamp = {2013-01-22T21:35:37.000+0100}, title = {A Pruning Based Incremental Construction Algorithm of Concept Lattice}, url = {http://dx.doi.org/10.1007/11790853_15}, username = {keinstein}, volume = 4065, year = 2006 }