Sciweavers

1025 search results - page 137 / 205
» Constraint Programming for Data Mining and Machine Learning
Sort
View
ICML
2008
IEEE
16 years 3 months ago
Expectation-maximization for sparse and non-negative PCA
We study the problem of finding the dominant eigenvector of the sample covariance matrix, under additional constraints on the vector: a cardinality constraint limits the number of...
Christian D. Sigg, Joachim M. Buhmann
ECML
2006
Springer
15 years 6 months ago
An Adaptive Kernel Method for Semi-supervised Clustering
Semi-supervised clustering uses the limited background knowledge to aid unsupervised clustering algorithms. Recently, a kernel method for semi-supervised clustering has been introd...
Bojun Yan, Carlotta Domeniconi
ECML
2007
Springer
15 years 6 months ago
Finding Composite Episodes
Mining frequent patterns is a major topic in data mining research, resulting in many seminal papers and algorithms on item set and episode discovery. The combination of these, call...
Ronnie Bathoorn, Arno Siebes
KDD
2008
ACM
128views Data Mining» more  KDD 2008»
16 years 3 months ago
Scaling up text classification for large file systems
: We combine the speed and scalability of information retrieval with the generally superior classification accuracy offered by machine learning, yielding a two-phase text classifie...
George Forman, Shyamsundar Rajaram
SAC
2010
ACM
14 years 9 months ago
A study on interestingness measures for associative classifiers
Associative classification is a rule-based approach to classify data relying on association rule mining by discovering associations between a set of features and a class label. Su...
Mojdeh Jalali Heravi, Osmar R. Zaïane