Sciweavers

23 search results - page 2 / 5
» Mining Formal Concepts with a Bounded Number of Exceptions f...
Sort
View
ICFCA
2009
Springer
13 years 11 months ago
Yet a Faster Algorithm for Building the Hasse Diagram of a Concept Lattice
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...
Jaume Baixeries, Laszlo Szathmary, Petko Valtchev,...
KDD
2004
ACM
134views Data Mining» more  KDD 2004»
14 years 4 months ago
Exploiting a support-based upper bound of Pearson's correlation coefficient for efficiently identifying strongly correlated pair
Given a user-specified minimum correlation threshold and a market basket database with N items and T transactions, an all-strong-pairs correlation query finds all item pairs with...
Hui Xiong, Shashi Shekhar, Pang-Ning Tan, Vipin Ku...
PKDD
1998
Springer
123views Data Mining» more  PKDD 1998»
13 years 8 months ago
Querying Inductive Databases: A Case Study on the MINE RULE Operator
Knowledge discovery in databases (KDD) is a process that can include steps like forming the data set, data transformations, discovery of patterns, searching for exceptions to a pat...
Jean-François Boulicaut, Mika Klemettinen, ...
PKDD
2005
Springer
110views Data Mining» more  PKDD 2005»
13 years 9 months ago
k-Anonymous Patterns
It is generally believed that data mining results do not violate the anonymity of the individuals recorded in the source database. In fact, data mining models and patterns, in orde...
Maurizio Atzori, Francesco Bonchi, Fosca Giannotti...
SDM
2008
SIAM
139views Data Mining» more  SDM 2008»
13 years 5 months ago
Maximal Quasi-Bicliques with Balanced Noise Tolerance: Concepts and Co-clustering Applications
The rigid all-versus-all adjacency required by a maximal biclique for its two vertex sets is extremely vulnerable to missing data. In the past, several types of quasi-bicliques ha...
Jinyan Li, Kelvin Sim, Guimei Liu, Limsoon Wong