Sciweavers

1691 search results - page 28 / 339
» Restricted subset selection
Sort
View
AAAI
2011
12 years 8 months ago
Size Adaptive Selection of Most Informative Features
In this paper, we propose a novel method to select the most informative subset of features, which has little redundancy and very strong discriminating power. Our proposed approach...
Si Liu, Hairong Liu, Longin Jan Latecki, Shuicheng...
TNN
2008
133views more  TNN 2008»
13 years 8 months ago
A General Wrapper Approach to Selection of Class-Dependent Features
In this paper, we argue that for a C-class classification problem, C 2-class classifiers, each of which discriminating one class from the other classes and having a characteristic ...
Lipo Wang, Nina Zhou, Feng Chu
CCCG
2007
13 years 10 months ago
A Lower Bound on the Area of a 3-Coloured Disc Packing
Given a set of unit-discs in the plane with union area A, what fraction of A can be covered by selecting a pairwise disjoint subset of the discs? Rado conjectured
Peter Brass, Ferran Hurtado, Benjamin J. Lafrenier...
KDD
1998
ACM
200views Data Mining» more  KDD 1998»
14 years 1 months ago
Fast Computation of 2-Dimensional Depth Contours
"Oneperson's noise is another person's signal." For manyapplications, including the detection of credit card frauds and the monitoringof criminal activities in...
Theodore Johnson, Ivy Kwok, Raymond T. Ng
PAKDD
2000
ACM
124views Data Mining» more  PAKDD 2000»
14 years 13 days ago
Feature Selection for Clustering
In clustering, global feature selection algorithms attempt to select a common feature subset that is relevant to all clusters. Consequently, they are not able to identify individu...
Manoranjan Dash, Huan Liu