Sciweavers

654 search results - page 74 / 131
» Mining the Most Interesting Rules
Sort
View
KDD
1999
ACM
217views Data Mining» more  KDD 1999»
15 years 4 months ago
An Efficient Algorithm to Update Large Itemsets with Early Pruning
We present an efficient algorithm (UWEP) for updating large itemsets when new transactions are added to the set of old transactions. UWEP employs a dynamic lookahead strategy in u...
Necip Fazil Ayan, Abdullah Uz Tansel, M. Erol Arku...
ICDM
2005
IEEE
187views Data Mining» more  ICDM 2005»
15 years 5 months ago
Parallel Algorithms for Distance-Based and Density-Based Outliers
An outlier is an observation that deviates so much from other observations as to arouse suspicion that it was generated by a different mechanism. Outlier detection has many applic...
Elio Lozano, Edgar Acuña
PVLDB
2008
107views more  PVLDB 2008»
14 years 11 months ago
Finding relevant patterns in bursty sequences
Sequence data is ubiquitous and finding frequent sequences in a large database is one of the most common problems when analyzing sequence data. Unfortunately many sources of seque...
Alexander Lachmann, Mirek Riedewald
KDD
2002
ACM
106views Data Mining» more  KDD 2002»
16 years 7 days ago
Selecting the right interestingness measure for association patterns
Many techniques for association rule mining and feature selection require a suitable metric to capture the dependencies among variables in a data set. For example, metrics such as...
Pang-Ning Tan, Vipin Kumar, Jaideep Srivastava
89
Voted
BMCBI
2010
113views more  BMCBI 2010»
14 years 12 months ago
Gene prioritization and clustering by multi-view text mining
Background: Text mining has become a useful tool for biologists trying to understand the genetics of diseases. In particular, it can help identify the most interesting candidate g...
Shi Yu, Léon-Charles Tranchevent, Bart De M...