Sciweavers

986 search results - page 190 / 198
» Zero-data Learning of New Tasks
Sort
View
RSFDGRC
2005
Springer
190views Data Mining» more  RSFDGRC 2005»
15 years 3 months ago
Finding Rough Set Reducts with SAT
Abstract. Feature selection refers to the problem of selecting those input features that are most predictive of a given outcome; a problem encountered in many areas such as machine...
Richard Jensen, Qiang Shen, Andrew Tuson
ICDAR
2003
IEEE
15 years 3 months ago
Best Practices for Convolutional Neural Networks Applied to Visual Document Analysis
Neural networks are a powerful technology for classification of visual inputs arising from documents. However, there is a confusing plethora of different neural network methods th...
Patrice Simard, David Steinkraus, John C. Platt
KDD
2007
ACM
182views Data Mining» more  KDD 2007»
15 years 10 months ago
A fast algorithm for finding frequent episodes in event streams
Frequent episode discovery is a popular framework for mining data available as a long sequence of events. An episode is essentially a short ordered sequence of event types and the...
Srivatsan Laxman, P. S. Sastry, K. P. Unnikrishnan
KDD
2001
ACM
163views Data Mining» more  KDD 2001»
15 years 10 months ago
The "DGX" distribution for mining massive, skewed data
Skewed distributions appear very often in practice. Unfortunately, the traditional Zipf distribution often fails to model them well. In this paper, we propose a new probability di...
Zhiqiang Bi, Christos Faloutsos, Flip Korn
ICCV
2009
IEEE
16 years 2 months ago
Efficient subset selection based on the Renyi entropy
Many machine learning algorithms require the summation of Gaussian kernel functions, an expensive operation if implemented straightforwardly. Several methods have been proposed t...
Vlad I. Morariu1, Balaji V. Srinivasan, Vikas C. R...