New fast algorithm for constructing concept lattice

Authors:
YaJun Du;Zheng Pei;HaiMing Li;Dan Xiang;Kai Li
Affiliations:
School of Mathematical and Computers Science, Xihua University, Chengdu, Sichuan, China;School of Mathematical and Computers Science, Xihua University, Chengdu, Sichuan, China;School of Information Science and Technology, Zhe Jiang Forestry University, Lin'an, Zhejiang, China;School of Mathematical and Computers Science, Xihua University, Chengdu, Sichuan, China;School of Mathematical and Computers Science, Xihua University, Chengdu, Sichuan, China
Venue:
ICCSA'07 Proceedings of the 2007 international conference on Computational science and Its applications - Volume Part II
Year:
2007

Citing 7
Cited 4

Experimental comparison of navigation in a Galois lattice with conventional information retrieval methods

International Journal of Man-Machine Studies
A fast algorithm for building lattices

Information Processing Letters
A vector space model for automatic indexing

Communications of the ACM
Formal Concept Analysis: Mathematical Foundations

Formal Concept Analysis: Mathematical Foundations
Computing iceberg concept lattices with TITANIC

Data & Knowledge Engineering
Search for Concepts and Dependencies in Databases

RSKD '93 Proceedings of the International Workshop on Rough Sets and Knowledge Discovery: Rough Sets, Fuzzy Sets and Knowledge Discovery
Fast Access to Concepts in Concept Lattices via Bidirectional Associative Memories

Neural Computation

Strategy for mining association rules for web pages based on formal concept analysis

Applied Soft Computing
Semantic ranking of web pages based on formal concept analysis

Journal of Systems and Software
Lattice navigation for collaborative filtering by means of (fuzzy) formal concept analysis

Proceedings of the 28th Annual ACM Symposium on Applied Computing
An approach for selecting seed URLs of focused crawler based on user-interest ontology

Applied Soft Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Concept lattice is an important method and technology for data analysis and knowledge discovery, however, in this research field, many researchers focus on two-valued formal context. In this paper, we transform continuous-valued formal context into many-valued formal context first, then on the basis of many-valued formal context, the definition of the equivalence class of single attribute and formal pairs of single attribute are given. We discuss constructing formal concept lattice based on single attribute concepts, uniting concepts, updating concept and adding concepts, all these concepts are generated by union, intersection and equality of objects of formal pairs. At last, we present a fast algorithm for constructing concept lattice and analyze its complexity. It has demonstrated that the algorithm is effective by our experiments.