63 search results - page 4 / 13 » Computing iceberg concept lattices with T |
ICCS
2005
Springer
13 years 11 months ago
2005
Springer
Abstract Bioinformatic data sources available on the web are multiple and heterogenous. The lack of documentation and the difficulty of interaction with these data banks require us...
ACL
2010
13 years 3 months ago
2010
Constructing an encoding of a concept lattice using short bit vectors allows for efficient computation of join operations on the lattice. Join is the central operation any unifica...
IRI
2006
IEEE
13 years 11 months ago
2006
IEEE
— Maximal full rectangles in tabular data are useful in several areas of data engineering. This paper presents a survey of results in which we replace “full rectangles” by ...
ICFCA
2009
Springer
14 years 3 days ago
2009
Springer
Formal concept analysis (FCA) is increasingly applied to data mining problems, essentially as a formal framework for mining reduced representations (bases) of target pattern famili...
ICFCA
2009
Springer
13 years 3 months ago
2009
Springer
Abstract. Standard Support Vector Machines (SVM) text classification relies on bag-of-words kernel to express the similarity between documents. We show that a document lattice can ...