Sciweavers

7623 search results - page 79 / 1525
» Algorithmic Features of Eclat
Sort
View
ICML
1996
IEEE
14 years 9 months ago
Toward Optimal Feature Selection
In this paper, we examine a method for feature subset selection based on Information Theory. Initially, a framework for de ning the theoretically optimal, but computationally intr...
Daphne Koller, Mehran Sahami
PAKDD
2000
ACM
124views Data Mining» more  PAKDD 2000»
14 years 10 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
ICDM
2010
IEEE
226views Data Mining» more  ICDM 2010»
13 years 6 months ago
Edge Weight Regularization over Multiple Graphs for Similarity Learning
The growth of the web has directly influenced the increase in the availability of relational data. One of the key problems in mining such data is computing the similarity between o...
Pradeep Muthukrishnan, Dragomir R. Radev, Qiaozhu ...
CVPR
2009
IEEE
15 years 3 months ago
Efficient Kernels for Identifying Unbounded-Order Spatial Features
Higher order spatial features, such as doublets or triplets have been used to incorporate spatial information into the bag-of-local-features model. Due to computational limits, ...
Yimeng Zhang (Carnegie Mellon University), Tsuhan ...
SDM
2007
SIAM
137views Data Mining» more  SDM 2007»
13 years 10 months ago
Semi-supervised Feature Selection via Spectral Analysis
Feature selection is an important task in effective data mining. A new challenge to feature selection is the so-called “small labeled-sample problem” in which labeled data is...
Zheng Zhao, Huan Liu