Sciweavers

63 search results - page 2 / 13
» Finding k-dominant skylines in high dimensional space
Sort
View
MASCOTS
2008
13 years 6 months ago
Finding Good Configurations in High-Dimensional Spaces: Doing More with Less
Manually tuning tens to hundreds of configuration parameters in a complex software system like a database or an application server is an arduous task. Recent work has looked into ...
Risi Thonangi, Vamsidhar Thummala, Shivnath Babu
ICDE
2008
IEEE
158views Database» more  ICDE 2008»
14 years 6 months ago
CARE: Finding Local Linear Correlations in High Dimensional Data
Finding latent patterns in high dimensional data is an important research problem with numerous applications. Existing approaches can be summarized into 3 categories: feature selec...
Xiang Zhang, Feng Pan, Wei Wang
VLDB
2000
ACM
229views Database» more  VLDB 2000»
13 years 8 months ago
Local Dimensionality Reduction: A New Approach to Indexing High Dimensional Spaces
Many emerging application domains require database systems to support efficient access over highly multidimensional datasets. The current state-of-the-art technique to indexing hi...
Kaushik Chakrabarti, Sharad Mehrotra
CIKM
2008
Springer
13 years 6 months ago
REDUS: finding reducible subspaces in high dimensional data
Finding latent patterns in high dimensional data is an important research problem with numerous applications. The most well known approaches for high dimensional data analysis are...
Xiang Zhang, Feng Pan, Wei Wang 0010
DEXA
2006
Springer
190views Database» more  DEXA 2006»
13 years 8 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