Sciweavers

319 search results - page 19 / 64
» Algorithms for Mining Distance-Based Outliers in Large Datas...
Sort
View
SDM
2009
SIAM
143views Data Mining» more  SDM 2009»
15 years 7 months ago
Finding Representative Association Rules from Large Rule Collections.
One of the most well-studied problems in data mining is computing association rules from large transactional databases. Often, the rule collections extracted from existing datamin...
Warren L. Davis IV, Peter Schwarz, Evimaria Terzi
DATAMINE
2006
127views more  DATAMINE 2006»
14 years 10 months ago
Computing LTS Regression for Large Data Sets
Least trimmed squares (LTS) regression is based on the subset of h cases (out of n) whose least squares t possesses the smallest sum of squared residuals. The coverage h may be se...
Peter Rousseeuw, Katrien van Driessen
SAC
2011
ACM
14 years 23 days ago
RuleGrowth: mining sequential rules common to several sequences by pattern-growth
Mining sequential rules from large databases is an important topic in data mining fields with wide applications. Most of the relevant studies focused on finding sequential rules a...
Philippe Fournier-Viger, Roger Nkambou, Vincent Sh...
KDD
2002
ACM
118views Data Mining» more  KDD 2002»
15 years 10 months ago
SECRET: a scalable linear regression tree algorithm
Recently there has been an increasing interest in developing regression models for large datasets that are both accurate and easy to interpret. Regressors that have these properti...
Alin Dobra, Johannes Gehrke
ICDM
2005
IEEE
168views Data Mining» more  ICDM 2005»
15 years 3 months ago
Discovering Frequent Arrangements of Temporal Intervals
In this paper we study a new problem in temporal pattern mining: discovering frequent arrangements of temporal intervals. We assume that the database consists of sequences of even...
Panagiotis Papapetrou, George Kollios, Stan Sclaro...