Sciweavers

2027 search results - page 46 / 406
» Learning and Generalization with the Information Bottleneck
Sort
View
KDD
2009
ACM
150views Data Mining» more  KDD 2009»
15 years 10 months ago
Information theoretic regularization for semi-supervised boosting
We present novel semi-supervised boosting algorithms that incrementally build linear combinations of weak classifiers through generic functional gradient descent using both labele...
Lei Zheng, Shaojun Wang, Yan Liu, Chi-Hoon Lee
COLT
2008
Springer
14 years 11 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
CIKM
2006
Springer
15 years 1 months ago
Performance thresholding in practical text classification
In practical classification, there is often a mix of learnable and unlearnable classes and only a classifier above a minimum performance threshold can be deployed. This problem is...
Hinrich Schütze, Emre Velipasaoglu, Jan O. Pe...
ISMIR
2005
Springer
127views Music» more  ISMIR 2005»
15 years 3 months ago
Distributed Audio Feature Extraction for Music
One of the important challenges facing music information retrieval (MIR) of audio signals is scaling analysis algorithms to large collections. Typically, analysis of audio signals...
Stuart Bray, George Tzanetakis
DEBU
2008
104views more  DEBU 2008»
14 years 10 months ago
Process Mining in Web Services: The WebSphere Case
Process mining has emerged as a way to discover or check the conformance of processes based on event logs. This enables organizations to learn from processes as they really take p...
Wil M. P. van der Aalst, H. M. W. (Eric) Verbeek