Sciweavers

1536 search results - page 191 / 308
» Approximately Dominating Representatives
Sort
View
130
Voted
PKDD
1999
Springer
118views Data Mining» more  PKDD 1999»
15 years 7 months ago
Mining Possibilistic Set-Valued Rules by Generating Prime Disjunctions
We describe the problem of mining possibilistic set-valued rules in large relational tables containing categorical attributes taking a finite number of values. An example of such a...
Alexandr A. Savinov
114
Voted
AAAI
2008
15 years 5 months ago
Learning to Analyze Binary Computer Code
We present a novel application of structured classification: identifying function entry points (FEPs, the starting byte of each function) in program binaries. Such identification ...
Nathan E. Rosenblum, Xiaojin Zhu, Barton P. Miller...
ANNPR
2008
Springer
15 years 5 months ago
Patch Relational Neural Gas - Clustering of Huge Dissimilarity Datasets
Clustering constitutes an ubiquitous problem when dealing with huge data sets for data compression, visualization, or preprocessing. Prototype-based neural methods such as neural g...
Alexander Hasenfuss, Barbara Hammer, Fabrice Rossi
117
Voted
COLT
2008
Springer
15 years 5 months ago
Finding Metric Structure in Information Theoretic Clustering
We study the problem of clustering discrete probability distributions with respect to the Kullback-Leibler (KL) divergence. This problem arises naturally in many applications. Our...
Kamalika Chaudhuri, Andrew McGregor
141
Voted
NIPS
2003
15 years 5 months ago
Attractive People: Assembling Loose-Limbed Models using Non-parametric Belief Propagation
The detection and pose estimation of people in images and video is made challenging by the variability of human appearance, the complexity of natural scenes, and the high dimensio...
Leonid Sigal, Michael Isard, Benjamin H. Sigelman,...