Sciweavers

581 search results - page 65 / 117
» Set partition patterns and statistics
Sort
View
JMLR
2012
12 years 11 days ago
A General Framework for Structured Sparsity via Proximal Optimization
We study a generalized framework for structured sparsity. It extends the well known methods of Lasso and Group Lasso by incorporating additional constraints on the variables as pa...
Luca Baldassarre, Jean Morales, Andreas Argyriou, ...
ICDM
2008
IEEE
96views Data Mining» more  ICDM 2008»
14 years 4 months ago
Filling in the Blanks - Krimp Minimisation for Missing Data
Many data sets are incomplete. For correct analysis of such data, one can either use algorithms that are designed to handle missing data or use imputation. Imputation has the bene...
Jilles Vreeken, Arno Siebes
MCS
2004
Springer
14 years 3 months ago
A Probabilistic Model Using Information Theoretic Measures for Cluster Ensembles
Abstract. This paper presents a probabilistic model for combining cluster ensembles utilizing information theoretic measures. Starting from a co-association matrix which summarizes...
Hanan Ayad, Otman A. Basir, Mohamed Kamel
MCS
2004
Springer
14 years 3 months ago
A Comparison of Ensemble Creation Techniques
We experimentally evaluate bagging and six other randomization-based approaches to creating an ensemble of decision-tree classifiers. Bagging uses randomization to create multipl...
Robert E. Banfield, Lawrence O. Hall, Kevin W. Bow...
CINQ
2004
Springer
151views Database» more  CINQ 2004»
14 years 1 months ago
Query Languages Supporting Descriptive Rule Mining: A Comparative Study
Recently, inductive databases (IDBs) have been proposed to tackle the problem of knowledge discovery from huge databases. With an IDB, the user/analyst performs a set of very diffe...
Marco Botta, Jean-François Boulicaut, Cyril...