Sciweavers

349 search results - page 51 / 70
» Autonomous feature-based exploration
Sort
View
KDD
2005
ACM
139views Data Mining» more  KDD 2005»
14 years 8 months ago
Reasoning about sets using redescription mining
Redescription mining is a newly introduced data mining problem that seeks to find subsets of data that afford multiple definitions. It can be viewed as a generalization of associa...
Mohammed Javeed Zaki, Naren Ramakrishnan
SMI
2005
IEEE
14 years 1 months ago
Stochastic Microgeometry for Displacement Mapping
Creating surfaces with intricate small-scale features (microgeometry) and detail is an important task in geometric modeling and computer graphics. We present a model processing me...
Craig A. Schroeder, David E. Breen, Christopher D....
SIGIR
2005
ACM
14 years 1 months ago
A Markov random field model for term dependencies
This paper develops a general, formal framework for modeling term dependencies via Markov random fields. The model allows for arbitrary text features to be incorporated as eviden...
Donald Metzler, W. Bruce Croft
MLDM
1999
Springer
14 years 11 days ago
Independent Feature Analysis for Image Retrieval
Content-based image retrieval methods based on the Euclidean metric expect the feature space to be isotropic. They su€er from unequal di€erential relevance of features in comput...
Jing Peng, Bir Bhanu
SIGIR
2010
ACM
13 years 12 months ago
How good is a span of terms?: exploiting proximity to improve web retrieval
Ranking search results is a fundamental problem in information retrieval. In this paper we explore whether the use of proximity and phrase information can improve web retrieval ac...
Krysta Marie Svore, Pallika H. Kanani, Nazan Khan