Results 1  10
of
697
Object Detection with Discriminatively Trained Part Based Models
"... We describe an object detection system based on mixtures of multiscale deformable part models. Our system is able to represent highly variable object classes and achieves stateoftheart results in the PASCAL object detection challenges. While deformable part models have become quite popular, their ..."
Abstract

Cited by 1422 (49 self)
 Add to MetaCart
, their value had not been demonstrated on difficult benchmarks such as the PASCAL datasets. Our system relies on new methods for discriminative training with partially labeled data. We combine a marginsensitive approach for datamining hard negative examples with a formalism we call latent SVM. A latent SVM
A discriminatively trained, multiscale, deformable part model
 In IEEE Conference on Computer Vision and Pattern Recognition (CVPR2008
, 2008
"... This paper describes a discriminatively trained, multiscale, deformable part model for object detection. Our system achieves a twofold improvement in average precision over the best performance in the 2006 PASCAL person detection challenge. It also outperforms the best results in the 2007 challenge ..."
Abstract

Cited by 555 (11 self)
 Add to MetaCart
training. We combine a marginsensitive approach for data mining hard negative examples with a formalism we call latent SVM. A latent SVM, like a hidden CRF, leads to a nonconvex training problem. However, a latent SVM is semiconvex and the training problem becomes convex once latent information
Fastmap: A fast algorithm for indexing, datamining and visualization of traditional and multimedia datasets
, 1995
"... A very promising idea for fast searching in traditional and multimedia databases is to map objects into points in kd space, using k featureextraction functions, provided by a domain expert [Jag91]. Thus, we can subsequently use highly finetuned spatial access methods (SAMs), to answer several ..."
Abstract

Cited by 502 (22 self)
 Add to MetaCart
types of queries, including the `Query By Example' type (which translates to a range query); the `all pairs' query (which translates to a spatial join [BKSS94]); the nearestneighbor or bestmatch query, etc. However, designing feature extraction functions can be hard. It is relatively
Matching words and pictures
 JOURNAL OF MACHINE LEARNING RESEARCH
, 2003
"... We present a new approach for modeling multimodal data sets, focusing on the specific case of segmented images with associated text. Learning the joint distribution of image regions and words has many applications. We consider in detail predicting words associated with whole images (autoannotation ..."
Abstract

Cited by 665 (40 self)
 Add to MetaCart
the relationships between image regions and semantic correlates (words) is an interesting example of multimodal data mining, particularly because it is typically hard to apply data mining techniques to collections of images. We develop a number of models for the joint distribution of image regions and words
NP IS AS EASY AS DETECTING UNIQUE SOLUTIONS
, 1986
"... For every known NPcomplete problem, the number of solutions of its instances varies over a large range, from zero to exponentially many. It is therefore natural to ask if the inherent intractability of NPcomplete problems is caused by this wide variation. We give a negative answer to this questi ..."
Abstract

Cited by 233 (1 self)
 Add to MetaCart
about the difficulty of specific problems follow. For example, computing the parity of the number of solutions of a SAT formula is shown to be NPhard, and deciding if a SAT formula has a unique solution is shown to be DPhard, under randomized reduction. Central to the study of cryptography
Secure distributed datamining and its application to largescale network measurements
 SIGCOMM Comput. Commun. Rev
"... The rapid growth of the Internet over the last decade has been startling. However, efforts to track its growth have often fallen afoul of bad data — for instance, how much traffic does the Internet now carry? The problem is not that the data is technically hard to obtain, or that it does not exist, ..."
Abstract

Cited by 14 (4 self)
 Add to MetaCart
The rapid growth of the Internet over the last decade has been startling. However, efforts to track its growth have often fallen afoul of bad data — for instance, how much traffic does the Internet now carry? The problem is not that the data is technically hard to obtain, or that it does not exist
Behavioral theories and the neurophysiology of reward,
 Annu. Rev. Psychol.
, 2006
"... ■ Abstract The functions of rewards are based primarily on their effects on behavior and are less directly governed by the physics and chemistry of input events as in sensory systems. Therefore, the investigation of neural mechanisms underlying reward functions requires behavioral theories that can ..."
Abstract

Cited by 187 (0 self)
 Add to MetaCart
as components of utility can be achieved mathematically by using, for example, the negative exponential utility function often employed in financial mathematics. Using the exponential utility function for EU results in which can be developed by the Laplace transform into where EV is expected value, var
PEBL: Web Page Classification without Negative Examples
 IEEE Transactions on Knowledge and Data Engineering
, 2004
"... Web page classification is one of the essential techniques for Web mining because classifying Web pages of an interesting class is often the first step of mining the Web. However, constructing a classifier for an interesting class requires laborious preprocessing such as collecting positive and ne ..."
Abstract

Cited by 48 (0 self)
 Add to MetaCart
and negative training examples. For instance, in order to construct a "homepage" classifier, one needs to collect a sample of homepages (positive examples) and a sample of nonhomepages (negative examples). In particular, collecting negative training examples requires arduous work and caution
Fastlk?ap: A Fast Algorithm for Indexing, DataMining and Visualization of Traditional and Multimedia Datasets
"... A very promising idea for fast searching in traditional and multimedia databases is to map objects into points in kd space, using k featureextraction functions, provided by a domain expert [25]. Thus, we can subsequently use highly finetuned spatial access methods (SAMS), to answer several types ..."
Abstract
 Add to MetaCart
similarit ies are preserved. There are two benefits from this mapping: (a) efficient ret rieval, in conjunction with a SAM, as discussed before and (b) visualization and datamining: the objects can now be plotted as points in 2d or 3d space, revealing pot ential clusters, correlations among attributes
Eerten “Hard squares with negative activity
 J. Phys. A
"... We show that the hardsquare lattice gas with activity z = −1 has a number of remarkable properties. We conjecture that all the eigenvalues of the transfer matrix are roots of unity. They fall into groups (“strings”) evenly spaced around the unit circle, which have interesting numbertheoretic prope ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
We show that the hardsquare lattice gas with activity z = −1 has a number of remarkable properties. We conjecture that all the eigenvalues of the transfer matrix are roots of unity. They fall into groups (“strings”) evenly spaced around the unit circle, which have interesting number
Results 1  10
of
697