498 search results - page 70 / 100 » DESCRY: A Density Based Clustering Algorithm for Very Large ... |
KES
2005
Springer
14 years 1 months ago
2005
Springer
In KDD procedure, to fill in missing data typically requires a very large investment of time and energy - often 80% to 90% of a data analysis project is spent in making the data re...
SIGMOD
2008
ACM
14 years 7 months ago
2008
ACM
The increasing complexity of enterprise databases and the prevalent lack of documentation incur significant cost in both understanding and integrating the databases. Existing solu...
AH
2008
Springer
14 years 1 months ago
2008
Springer
In order to navigate huge document collections efficiently, tagged hierarchical structures can be used. For users, it is important to correctly interpret tag combinations. In this ...
PDP
2008
IEEE
14 years 1 months ago
2008
IEEE
Search engines use inverted files as index data structures to speed up the solution of user queries. The index is distributed on a set of processors forming a cluster of computer...
CIKM
2007
Springer
14 years 1 months ago
2007
Springer
We consider the problem of document indexing and representation. Recently, Locality Preserving Indexing (LPI) was proposed for learning a compact document subspace. Different from...