Sciweavers

ICDM
2009
IEEE
174views Data Mining» more  ICDM 2009»
14 years 6 months ago
Non-sparse Multiple Kernel Learning for Fisher Discriminant Analysis
—We consider the problem of learning a linear combination of pre-specified kernel matrices in the Fisher discriminant analysis setting. Existing methods for such a task impose a...
Fei Yan, Josef Kittler, Krystian Mikolajczyk, Muha...
ICDM
2009
IEEE
117views Data Mining» more  ICDM 2009»
14 years 6 months ago
Redistricting Using Heuristic-Based Polygonal Clustering
— Redistricting is the process of dividing a geographic area into districts or zones. This process has been considered in the past as a problem that is computationally too comple...
Deepti Joshi, Leen-Kiat Soh, Ashok Samal
ICDM
2009
IEEE
133views Data Mining» more  ICDM 2009»
14 years 6 months ago
On K-Means Cluster Preservation Using Quantization Schemes
This work examines under what conditions compression methodologies can retain the outcome of clustering operations. We focus on the popular k-Means clustering algorithm and we dem...
Deepak S. Turaga, Michail Vlachos, Olivier Versche...
ICDM
2009
IEEE
111views Data Mining» more  ICDM 2009»
14 years 6 months ago
Permutation Tests for Studying Classifier Performance
Markus Ojala, Gemma C. Garriga
ICDM
2009
IEEE
155views Data Mining» more  ICDM 2009»
14 years 6 months ago
Stacked Gaussian Process Learning
—Triggered by a market relevant application that involves making joint predictions of pedestrian and public transit flows in urban areas, we address the question of how to utili...
Marion Neumann, Kristian Kersting, Zhao Xu, Daniel...
ICDM
2009
IEEE
129views Data Mining» more  ICDM 2009»
14 years 6 months ago
Extended Boolean Matrix Decomposition
—With the vast increase in collection and storage of data, the problem of data summarization is most critical for effective data management. Since much of this data is categorica...
Haibing Lu, Jaideep Vaidya, Vijayalakshmi Atluri, ...
ICDM
2009
IEEE
108views Data Mining» more  ICDM 2009»
14 years 6 months ago
RING: An Integrated Method for Frequent Representative Subgraph Mining
—We propose a novel representative based subgraph mining model. A series of standards and methods are proposed to select invariants. Patterns are mapped into invariant vectors in...
Shijie Zhang, Jiong Yang, Shirong Li
ICDM
2009
IEEE
152views Data Mining» more  ICDM 2009»
14 years 6 months ago
SLIDER: Mining Correlated Motifs in Protein-Protein Interaction Networks
Correlated motif mining (CMM) is the problem to find overrepresented pairs of patterns, called motif pairs, in interacting protein sequences. Algorithmic solutions for CMM thereb...
Peter Boyen, Frank Neven, Dries Van Dyck, Aalt-Jan...
ICDM
2009
IEEE
132views Data Mining» more  ICDM 2009»
14 years 6 months ago
Bayesian Overlapping Subspace Clustering
Given a data matrix, the problem of finding dense/uniform sub-blocks in the matrix is becoming important in several applications. The problem is inherently combinatorial since th...
Qiang Fu, Arindam Banerjee
ICDM
2009
IEEE
117views Data Mining» more  ICDM 2009»
14 years 6 months ago
Discriminative Mixed-Membership Models
Although mixed-membership models have achieved great success in unsupervised learning, they have not been widely applied to classification problems. In this paper, we propose a f...
Hanhuai Shan, Arindam Banerjee, Nikunj C. Oza