Sciweavers

4660 search results - page 610 / 932
» Learning from imperfect data
Sort
View
92
Voted
NIPS
2003
15 years 2 months ago
Hierarchical Topic Models and the Nested Chinese Restaurant Process
We address the problem of learning topic hierarchies from data. The model selection problem in this domain is daunting—which of the large collection of possible trees to use? We...
David M. Blei, Thomas L. Griffiths, Michael I. Jor...
107
Voted
SODA
1998
ACM
113views Algorithms» more  SODA 1998»
15 years 2 months ago
Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs
We develop data structures for dynamic closest pair problems with arbitrary (not necessarily geometric) distance functions, based on a technique previously used by the author for ...
David Eppstein
ALGORITHMICA
2010
95views more  ALGORITHMICA 2010»
15 years 29 days ago
Homogeneous String Segmentation using Trees and Weighted Independent Sets
We divide a string into k segments, each with only one sort of symbols, so as to minimize the total number of exceptions. Motivations come from machine learning and data mining. F...
Peter Damaschke
92
Voted
AUTOMATICA
2006
81views more  AUTOMATICA 2006»
15 years 26 days ago
An energy-gain bounding approach to robust fuzzy identification
A novel method for the robust identification of interpretable fuzzy models, based on the criterion that identification errors are least sensitive to data uncertainties and modelli...
Mohit Kumar, Norbert Stoll, Regina Stoll
112
Voted
TNN
2008
114views more  TNN 2008»
15 years 21 days ago
Relevance-Based Feature Extraction for Hyperspectral Images
Abstract--Hyperspectral imagery affords researchers all discriminating details needed for fine delineation of many material classes. This delineation is essential for scientific re...
Michael J. Mendenhall, Erzsébet Meré...