Sciweavers

1390 search results - page 158 / 278
» Self-Sizing of Clustered Databases
Sort
View
DEXA
2006
Springer
190views Database» more  DEXA 2006»
14 years 1 months ago
High-Dimensional Similarity Search Using Data-Sensitive Space Partitioning
Abstract. Nearest neighbor search has a wide variety of applications. Unfortunately, the majority of search methods do not scale well with dimensionality. Recent efforts have been ...
Sachin Kulkarni, Ratko Orlandic
DGO
2007
192views Education» more  DGO 2007»
13 years 11 months ago
D-HOTM: distributed higher order text mining
We present D-HOTM, a framework for Distributed Higher Order Text Mining based on named entities extracted from textual data that are stored in distributed relational databases. Unl...
William M. Pottenger
SDM
2010
SIAM
153views Data Mining» more  SDM 2010»
13 years 11 months ago
The Generalized Dimensionality Reduction Problem
The dimensionality reduction problem has been widely studied in the database literature because of its application for concise data representation in a variety of database applica...
Charu C. Aggarwal
SPIESR
1996
141views Database» more  SPIESR 1996»
13 years 11 months ago
Describing and Classifying Multimedia Using the Description Logic GRAIL
Many applications would benefit if media objects such as images could be selected and classified (or clustered) such that "conceptually similar" images are grouped toget...
Carole A. Goble, Christian Haul, Sean Bechhofer
ANOR
2010
135views more  ANOR 2010»
13 years 9 months ago
A framework of irregularity enlightenment for data pre-processing in data mining
Abstract Irregularities are widespread in large databases and often lead to erroneous conclusions with respect to data mining and statistical analysis. For example, considerable bi...
Siu-Tong Au, Rong Duan, Siamak G. Hesar, Wei Jiang