Sciweavers

783 search results - page 32 / 157
» Modeling High-Dimensional Index Structures using Sampling
Sort
View
CVPR
2007
IEEE
16 years 3 months ago
What makes a good model of natural images?
Many low-level vision algorithms assume a prior probability over images, and there has been great interest in trying to learn this prior from examples. Since images are very non G...
Yair Weiss, William T. Freeman
KDD
2010
ACM
274views Data Mining» more  KDD 2010»
15 years 5 months ago
Grafting-light: fast, incremental feature selection and structure learning of Markov random fields
Feature selection is an important task in order to achieve better generalizability in high dimensional learning, and structure learning of Markov random fields (MRFs) can automat...
Jun Zhu, Ni Lao, Eric P. Xing
BMCBI
2006
202views more  BMCBI 2006»
15 years 1 months ago
Spectral embedding finds meaningful (relevant) structure in image and microarray data
Background: Accurate methods for extraction of meaningful patterns in high dimensional data have become increasingly important with the recent generation of data types containing ...
Brandon W. Higgs, Jennifer W. Weller, Jeffrey L. S...
VLDB
2001
ACM
153views Database» more  VLDB 2001»
15 years 5 months ago
A Fast Index for Semistructured Data
Queries navigate semistructured data via path expressions, and can be accelerated using an index. Our solution encodes paths as strings, and inserts those strings into a special i...
Brian F. Cooper, Neal Sample, Michael J. Franklin,...
IJCNN
2000
IEEE
15 years 5 months ago
Regression Analysis for Rival Penalized Competitive Learning Binary Tree
The main aim of this paper is to develop a suitable regression analysis model for describing the relationship between the index efficiency and the parameters of the Rival Penaliz...
Xuequn Li, Irwin King