4541 search results - page 292 / 909 » Cache-Oblivious Algorithms and Data Structures |
144
click to vote
CIKM
2006
Springer
15 years 5 months ago
2006
Springer
In this paper, we propose a fast, memory-efficient, and scalable clustering algorithm for analyzing transactional data. Our approach has three unique features. First, we use the c...
154
click to vote
DATAMINE
2006
15 years 3 months ago
2006
With the growing importance of time series clustering research, particularly for similarity searches amongst long time series such as those arising in medicine or finance, it is cr...
104
click to vote
WEBI
2004
Springer
15 years 9 months ago
2004
Springer
— Distributed data mining has recently caught a lot of attention as there are many cases where pooling distributed data for mining is probibited, due to either huge data volume o...
130
click to vote
VRST
2009
ACM
15 years 10 months ago
2009
ACM
For the convenient reuse of large-scale 3D motion capture data, browsing and searching methods for the data should be explored. In this paper, an efficient indexing and retrieval...
KDD
1995
ACM
15 years 7 months ago
1995
ACM
We discuss the use of database met hods for data mining. Recently impressive results have been achieved for some data mining problems using highly specialized and clever data stru...