Sciweavers

67 search results - page 8 / 14
» A More Effective Linear Kernelization for Cluster Editing
Sort
View
AAAI
2004
13 years 9 months ago
Distributed Representation of Syntactic Structure by Tensor Product Representation and Non-Linear Compression
Representing lexicons and sentences with the subsymbolic approach (using techniques such as Self Organizing Map (SOM) or Artificial Neural Network (ANN)) is a relatively new but i...
Heidi H. T. Yeung, Peter W. M. Tsang
ALGORITHMICA
2006
139views more  ALGORITHMICA 2006»
13 years 7 months ago
CONQUEST: A Coarse-Grained Algorithm for Constructing Summaries of Distributed Discrete Datasets
Abstract. In this paper we present a coarse-grained parallel algorithm, CONQUEST, for constructing boundederror summaries of high-dimensional binary attributed data in a distribute...
Jie Chi, Mehmet Koyutürk, Ananth Grama
CVPR
2007
IEEE
14 years 9 months ago
Feature Extraction by Maximizing the Average Neighborhood Margin
A novel algorithm called Average Neighborhood Margin Maximization (ANMM) is proposed for supervised linear feature extraction. For each data point, ANMM aims at pulling the neighb...
Fei Wang, Changshui Zhang
SIGMOD
2004
ACM
154views Database» more  SIGMOD 2004»
14 years 7 months ago
Computing Clusters of Correlation Connected Objects
The detection of correlations between different features in a set of feature vectors is a very important data mining task because correlation indicates a dependency between the fe...
Christian Böhm, Karin Kailing, Peer Krög...
ICCV
2009
IEEE
15 years 21 days ago
Robust Fitting of Multiple Structures: The Statistical Learning Approach
We propose an unconventional but highly effective approach to robust fitting of multiple structures by using statistical learning concepts. We design a novel Mercer kernel for t...
Tat-Jun Chin, Hanzi Wang, David Suter