Sciweavers

1165 search results - page 183 / 233
» Ontology-Enhanced Association Mining
Sort
View
ICDM
2005
IEEE
177views Data Mining» more  ICDM 2005»
14 years 2 months ago
Average Number of Frequent (Closed) Patterns in Bernouilli and Markovian Databases
In data mining, enumerate the frequent or the closed patterns is often the first difficult task leading to the association rules discovery. The number of these patterns represen...
Loïck Lhote, François Rioult, Arnaud S...
DAWAK
1999
Springer
14 years 1 months ago
Modeling KDD Processes within the Inductive Database Framework
One of the most challenging problems in data manipulation in the future is to be able to e ciently handle very large databases but also multiple induced properties or generalizatio...
Jean-François Boulicaut, Mika Klemettinen, ...
KDD
1997
ACM
154views Data Mining» more  KDD 1997»
14 years 11 days ago
Autonomous Discovery of Reliable Exception Rules
This paper presents an autonomous algorithm for discovering exception rules from data sets. An exception rule, which is defined as a deviational pattern to a well-known fact, exhi...
Einoshin Suzuki
SDM
2007
SIAM
107views Data Mining» more  SDM 2007»
13 years 10 months ago
On Demand Phenotype Ranking through Subspace Clustering
High throughput biotechnologies have enabled scientists to collect a large number of genetic and phenotypic attributes for a large collection of samples. Computational methods are...
Xiang Zhang, Wei Wang 0010, Jun Huan
SDM
2003
SIAM
134views Data Mining» more  SDM 2003»
13 years 10 months ago
Hierarchical Document Clustering using Frequent Itemsets
A major challenge in document clustering is the extremely high dimensionality. For example, the vocabulary for a document set can easily be thousands of words. On the other hand, ...
Benjamin C. M. Fung, Ke Wang, Martin Ester