Sciweavers

1083 search results - page 21 / 217
» Efficient Discovery of Confounders in Large Data Sets
Sort
View
VISUALIZATION
2003
IEEE
14 years 28 days ago
Accelerating Large Data Analysis by Exploiting Regularities
We present techniques for discovering and exploiting regularity in large curvilinear data sets. The data can be based on a single mesh or a mesh composed of multiple submeshes (al...
David Ellsworth, Patrick J. Moran
RSCTC
2000
Springer
143views Fuzzy Logic» more  RSCTC 2000»
13 years 11 months ago
On Efficient Construction of Decision Trees from Large Databases
The main task in decision tree construction algorithms is to find the "best partition" of the set of objects. In this paper, we investigate the problem of optimal binary ...
Hung Son Nguyen
EDBT
2006
ACM
122views Database» more  EDBT 2006»
14 years 7 months ago
TQuEST: Threshold Query Execution for Large Sets of Time Series
Effective and efficient data mining in time series databases is essential in many application domains as for instance in financial analysis, medicine, meteorology, and environmenta...
Johannes Aßfalg, Hans-Peter Kriegel, Peer Kr...
KDD
1999
ACM
217views Data Mining» more  KDD 1999»
13 years 12 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...
JISE
2008
108views more  JISE 2008»
13 years 7 months ago
Efficient Discovery of Frequent Continuities by Projected Window List Technology
Mining frequent patterns in databases is a fundamental and essential problem in data mining research. A continuity is a kind of causal relationship which describes a definite temp...
Kuo-Yu Huang, Chia-Hui Chang, Kuo-Zui Lin