Sciweavers

7 search results - page 1 / 2
» Using Blind Search and Formal Concepts for Binary Factor Ana...
Sort
View
DATESO
2004
116views Database» more  DATESO 2004»
13 years 8 months ago
Using Blind Search and Formal Concepts for Binary Factor Analysis
Binary Factor Analysis (BFA, also known as Boolean Factor Analysis) may help with understanding collections of binary data. Since we can take collections of text documents as binar...
Ales Keprt
CLA
2004
13 years 8 months ago
Binary Factor Analysis with Help of Formal Concepts
Binary factor analysis (BFA, also known as Boolean Factor Analysis) is a nonhierarchical analysis of binary data, based on reduction of binary space dimension. It allows us to find...
Ales Keprt, Václav Snásel
IDA
2009
Springer
13 years 11 months ago
Distributed Algorithm for Computing Formal Concepts Using Map-Reduce Framework
Searching for interesting patterns in binary matrices plays an important role in data mining and, in particular, in formal concept analysis and related disciplines. Several algorit...
Petr Krajca, Vilém Vychodil
CAIP
2009
Springer
114views Image Analysis» more  CAIP 2009»
13 years 10 months ago
Decision Trees Using the Minimum Entropy-of-Error Principle
Binary decision trees based on univariate splits have traditionally employed so-called impurity functions as a means of searching for the best node splits. Such functions use estim...
Joaquim Marques de Sá, João Gama, Ra...
ICCS
2005
Springer
14 years 13 days ago
Querying a Bioinformatic Data Sources Registry with Concept Lattices
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...
Nizar Messai, Marie-Dominique Devignes, Amedeo Nap...