Sciweavers

548 search results - page 60 / 110
» Iterated importance sampling in missing data problems
Sort
View
CVPR
2010
IEEE
14 years 9 months ago
P-N learning: Bootstrapping binary classifiers by structural constraints
This paper shows that the performance of a binary classifier can be significantly improved by the processing of structured unlabeled data, i.e. data are structured if knowing the ...
Zdenek Kalal, Jiri Matas, Krystian Mikolajczyk
SIGMOD
2001
ACM
229views Database» more  SIGMOD 2001»
15 years 11 months ago
A Robust, Optimization-Based Approach for Approximate Answering of Aggregate Queries
The ability to approximately answer aggregation queries accurately and efficiently is of great benefit for decision support and data mining tools. In contrast to previous sampling...
Surajit Chaudhuri, Gautam Das, Vivek R. Narasayya
ICPR
2004
IEEE
16 years 4 days ago
Efficient Calculation of the Complete Optimal Classification Set
Feature and structure selection is an important part of many classification problems. In previous papers, an approach called basis pursuit classification has been proposed which p...
Martin Brown, Nicholas Costen, Shigeru Akamatsu
SIGIR
2003
ACM
15 years 4 months ago
ReCoM: reinforcement clustering of multi-type interrelated data objects
Most existing clustering algorithms cluster highly related data objects such as Web pages and Web users separately. The interrelation among different types of data objects is eith...
Jidong Wang, Hua-Jun Zeng, Zheng Chen, Hongjun Lu,...
ICTAI
2009
IEEE
14 years 8 months ago
Real-Valued Feature Selection by Mutual Information of Order 2
The selection of features for classification, clustering and approximation is an important task in pattern recognition, data mining and soft computing. For real-valued features, th...
Rüdiger W. Brause