Partitioning Large Data to Scale up Lattice-Based Algorithm

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Huaiguo Fu Articles by Engelbert Mephu Nguifo

15th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'03)

Sacramento, California, USA

November 03-November 05

ISBN: 0-7695-2038-3

	ASCII Text	x
	Huaiguo Fu, Engelbert Mephu Nguifo, "Partitioning Large Data to Scale up Lattice-Based Algorithm," Tools with Artificial Intelligence, IEEE International Conference on, pp. 537, 15th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'03), 2003.

	BibTex	x
	@article{ 10.1109/TAI.2003.1250237, author = {Huaiguo Fu and Engelbert Mephu Nguifo}, title = {Partitioning Large Data to Scale up Lattice-Based Algorithm}, journal ={Tools with Artificial Intelligence, IEEE International Conference on}, volume = {0}, year = {2003}, issn = {1082-3409}, pages = {537}, doi = {http://doi.ieeecomputersociety.org/10.1109/TAI.2003.1250237}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Tools with Artificial Intelligence, IEEE International Conference on TI - Partitioning Large Data to Scale up Lattice-Based Algorithm SN - 1082-3409 SP EP A1 - Huaiguo Fu, A1 - Engelbert Mephu Nguifo, PY - 2003 KW - null VL - 0 JA - Tools with Artificial Intelligence, IEEE International Conference on ER -

Huaiguo Fu, Université déArtois

Engelbert Mephu Nguifo, Université déArtois

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TAI.2003.1250237

Concept lattice is an effective tool and platform for data analysis and knowledge discovery such as classi.cation or association rules mining. The lattice algorithm to build formal concepts and concept lattice plays an essential role in the application of concept lattice. We propose a new efficient scalable lattice-based algorithm: ScalingNextClosure to decompose the search space of any huge data in some partitions, and then generate independently concepts (or closed itemsets) in each partition. The experimental results show the efficiency of this algorithm.

Citation:

Huaiguo Fu, Engelbert Mephu Nguifo, "Partitioning Large Data to Scale up Lattice-Based Algorithm," ictai, pp.537, 15th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'03), 2003

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.