Lindig’s Algorithm for Concept Lattices over Graded Attributes

Radim Bělohlávek; Bernard De Baets; Jan Outrata; Vilém Vychodil

doi:10.1007/978-3-540-73729-2_15

ScienceGate Book Chapters

BOOK-CHAPTER

Lindig’s Algorithm for Concept Lattices over Graded Attributes

Radim Bělohlávek Bernard De Baets Jan Outrata Vilém Vychodil

Year: 2007 Lecture notes in computer science Pages: 156-167 Publisher: Springer Science+Business Media

DOI: 10.1007/978-3-540-73729-2_15

Get Full-Text PDF Get Analytical Report

Keywords:

Formal concept analysis Computer science Lattice Miner Row Hierarchy Table (database) Focus (optics) Theoretical computer science Data structure Algorithm Data mining Database Programming language

Metrics

Cited By

0.34

FWCI (Field Weighted Citation Impact)

Refs

0.53

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Rough Sets and Fuzzy Logic

Physical Sciences → Computer Science → Computational Theory and Mathematics

Data Mining Algorithms and Applications

Physical Sciences → Computer Science → Information Systems

Data Management and Algorithms

Physical Sciences → Computer Science → Signal Processing

Lindig’s Algorithm for Concept Lattices over Graded Attributes

Metrics

Citation History

Topics

Related Documents

Triadic concept lattices of data with graded attributes

Incremental Algorithm for Constructing Fuzzy Concept Lattices Based on Attributes Decrement

Classification and reduction of attributes in concept lattices

Relational Data,Formal Concept Analysis, and Graded Attributes

Relational Data,Formal Concept Analysis, and Graded Attributes