Sciweavers

2180 search results - page 114 / 436
» Algorithms for discovering bucket orders from data
Sort
View
KDD
2009
ACM
239views Data Mining» more  KDD 2009»
16 years 5 months ago
Tell me something I don't know: randomization strategies for iterative data mining
There is a wide variety of data mining methods available, and it is generally useful in exploratory data analysis to use many different methods for the same dataset. This, however...
Heikki Mannila, Kai Puolamäki, Markus Ojala, ...
SIGMOD
1997
ACM
134views Database» more  SIGMOD 1997»
15 years 8 months ago
Scalable Parallel Data Mining for Association Rules
One of the important problems in data mining is discovering association rules from databases of transactions where each transaction consists of a set of items. The most time consu...
Eui-Hong Han, George Karypis, Vipin Kumar
ICDM
2010
IEEE
142views Data Mining» more  ICDM 2010»
15 years 2 months ago
Causal Discovery from Streaming Features
In this paper, we study a new research problem of causal discovery from streaming features. A unique characteristic of streaming features is that not all features can be available ...
Kui Yu, Xindong Wu, Hao Wang, Wei Ding
ICDE
2009
IEEE
173views Database» more  ICDE 2009»
16 years 6 months ago
Efficient Processing of Warping Time Series Join of Motion Capture Data
Discovering non-trivial matching subsequences from two time series is very useful in synthesizing novel time series. This can be applied to applications such as motion synthesis wh...
Yueguo Chen, Gang Chen, Ke Chen, Beng Chin Ooi
QEST
2009
IEEE
15 years 11 months ago
On the Impact of Modelling Choices for Distributed Information Spread
—We consider a distributed shuffling algorithm for sharing data in a distributed network. Nodes executing the algorithm periodically contact each other and exchange data. The be...
Rena Bakhshi, Ansgar Fehnker