Sciweavers

400 search results - page 77 / 80
» Subspace evasive sets
Sort
View
ICIP
2003
IEEE
14 years 9 months ago
Statistical learning for effective visual information retrieval
For effective retrieval of visual information, statistical learning plays a pivotal role. Statistical learning in such a context faces at least two major mathematical challenges: ...
Edward Y. Chang, Beitao Li, Gang Wu, Kingshy Goh
ICDE
2002
IEEE
164views Database» more  ICDE 2002»
14 years 9 months ago
Towards Meaningful High-Dimensional Nearest Neighbor Search by Human-Computer Interaction
Nearest Neighbor search is an important and widely used problem in a number of important application domains. In many of these domains, the dimensionality of the data representati...
Charu C. Aggarwal
KDD
2009
ACM
191views Data Mining» more  KDD 2009»
14 years 8 months ago
Efficient methods for topic model inference on streaming document collections
Topic models provide a powerful tool for analyzing large text collections by representing high dimensional data in a low dimensional subspace. Fitting a topic model given a set of...
Limin Yao, David M. Mimno, Andrew McCallum
KDD
2004
ACM
114views Data Mining» more  KDD 2004»
14 years 8 months ago
Scalable mining of large disk-based graph databases
Mining frequent structural patterns from graph databases is an interesting problem with broad applications. Most of the previous studies focus on pruning unfruitful search subspac...
Chen Wang, Wei Wang 0009, Jian Pei, Yongtai Zhu, B...
SIGMOD
2006
ACM
102views Database» more  SIGMOD 2006»
14 years 7 months ago
DADA: a data cube for dominant relationship analysis
The concept of dominance has recently attracted much interest in the context of skyline computation. Given an Ndimensional data set S, a point p is said to dominate q if p is bett...
Cuiping Li, Beng Chin Ooi, Anthony K. H. Tung, Sha...