Sciweavers

253 search results - page 35 / 51
» Fast algorithms for time series mining
Sort
View
KDD
2004
ACM
168views Data Mining» more  KDD 2004»
15 years 10 months ago
Mining, indexing, and querying historical spatiotemporal data
In many applications that track and analyze spatiotemporal data, movements obey periodic patterns; the objects follow the same routes (approximately) over regular time intervals. ...
Nikos Mamoulis, Huiping Cao, George Kollios, Mario...
WWW
2007
ACM
15 years 10 months ago
Why we search: visualizing and predicting user behavior
The aggregation and comparison of behavioral patterns on the WWW represent a tremendous opportunity for understanding past behaviors and predicting future behaviors. In this paper...
Eytan Adar, Daniel S. Weld, Brian N. Bershad, Stev...
92
Voted
ICRA
2007
IEEE
139views Robotics» more  ICRA 2007»
15 years 4 months ago
Multi-Robot Formations based on the Queue-Formation Scheme with Limited Communications
— In this paper, we investigate the operation of the Queue-formation structure (or Q-structure) in multi-robot teams with limited communications. Information flow is divided int...
Cheng-Heng Fua, Shuzhi Sam Ge, Khac Duc Do, Khiang...
EOR
2007
96views more  EOR 2007»
14 years 10 months ago
A fast method for discovering critical edge sequences in e-commerce catalogs
Web sites allow the collection of vast amounts of navigational data – clickstreams of user traversals through the site. These massive data stores offer the tantalizing possibil...
Kaushik Dutta, Debra E. VanderMeer, Anindya Datta,...
ICDE
2008
IEEE
141views Database» more  ICDE 2008»
15 years 11 months ago
A General Framework for Fast Co-clustering on Large Datasets Using Matrix Decomposition
Abstract-- Simultaneously clustering columns and rows (coclustering) of large data matrix is an important problem with wide applications, such as document mining, microarray analys...
Feng Pan, Xiang Zhang, Wei Wang 0010