Sciweavers

298 search results - page 58 / 60
» Subspace Clustering of High Dimensional Data
Sort
View
SSDBM
2005
IEEE
184views Database» more  SSDBM 2005»
13 years 10 months ago
Optimizing Multiple Top-K Queries over Joins
Advanced Data Mining applications require more and more support from relational database engines. Especially clustering applications in high dimensional features space demand a pr...
Dirk Habich, Wolfgang Lehner, Alexander Hinneburg
CIKM
2008
Springer
13 years 6 months ago
Peer-to-peer similarity search over widely distributed document collections
This paper addresses the challenging problem of similarity search over widely distributed ultra-high dimensional data. Such an application is retrieval of the top-k most similar d...
Christos Doulkeridis, Kjetil Nørvåg, ...
TSMC
2010
12 years 11 months ago
Fractional Particle Swarm Optimization in Multidimensional Search Space
In this paper, we propose two novel techniques, which successfully address several major problems in the field of particle swarm optimization (PSO) and promise a significant breakt...
Serkan Kiranyaz, Turker Ince, E. Alper Yildirim, M...
DATAMINE
2007
135views more  DATAMINE 2007»
13 years 4 months ago
Experiencing SAX: a novel symbolic representation of time series
Many high level representations of time series have been proposed for data mining, including Fourier transforms, wavelets, eigenwaves, piecewise polynomial models etc. Many researc...
Jessica Lin, Eamonn J. Keogh, Li Wei, Stefano Lona...
SIGMOD
2002
ACM
129views Database» more  SIGMOD 2002»
14 years 4 months ago
Dwarf: shrinking the PetaCube
Dwarf is a highly compressed structure for computing, storing, and querying data cubes. Dwarf identifies prefix and suffix structural redundancies and factors them out by coalesci...
Yannis Sismanis, Antonios Deligiannakis, Nick Rous...