Sciweavers

253 search results - page 33 / 51
» Fast algorithms for time series mining
Sort
View
SSD
2001
Springer
218views Database» more  SSD 2001»
15 years 2 months ago
Efficient Mining of Spatiotemporal Patterns
The problem of mining spatiotemporal patterns is finding sequences of events that occur frequently in spatiotemporal datasets. Spatiotemporal datasets store the evolution of object...
Ilias Tsoukatos, Dimitrios Gunopulos
KDD
1998
ACM
145views Data Mining» more  KDD 1998»
15 years 2 months ago
Coincidence Detection: A Fast Method for Discovering Higher-Order Correlations in Multidimensional Data
Wepresent a novel, fast methodfor associationminingill high-dimensionaldatasets. OurCoincidence Detection method, which combines random sampling and Chernoff-Hoeffding bounds with...
Evan W. Steeg, Derek A. Robinson, Ed Willis
89
Voted
ICDM
2009
IEEE
160views Data Mining» more  ICDM 2009»
15 years 4 months ago
Fast Online Training of Ramp Loss Support Vector Machines
—A fast online algorithm OnlineSVMR for training Ramp-Loss Support Vector Machines (SVMR s) is proposed. It finds the optimal SVMR for t+1 training examples using SVMR built on t...
Zhuang Wang, Slobodan Vucetic
DASFAA
2006
IEEE
136views Database» more  DASFAA 2006»
15 years 4 months ago
Mining Outliers in Spatial Networks
Outlier analysis is an important task in data mining and has attracted much attention in both research and applications. Previous work on outlier detection involves different type...
Wen Jin, Yuelong Jiang, Weining Qian, Anthony K. H...
SIGMOD
2008
ACM
157views Database» more  SIGMOD 2008»
15 years 10 months ago
CRD: fast co-clustering on large datasets utilizing sampling-based matrix decomposition
The problem of simultaneously clustering columns and rows (coclustering) arises in important applications, such as text data mining, microarray analysis, and recommendation system...
Feng Pan, Xiang Zhang, Wei Wang 0010