Sciweavers

2600 search results - page 42 / 520
» Clustering with or without the Approximation
Sort
View
COLING
2008
13 years 9 months ago
A Framework for Identifying Textual Redundancy
The task of identifying redundant information in documents that are generated from multiple sources provides a significant challenge for summarization and QA systems. Traditional ...
Kapil Thadani, Kathleen McKeown
WILF
2009
Springer
791views Fuzzy Logic» more  WILF 2009»
14 years 6 months ago
Fuzzy C-Means Inspired Free Form Deformation Technique for Registration
This paper presents a novel method aimed to free form deformation function approximation for purpose of image registration. The method is currently feature-based. The algorithm i...
Edoardo Ardizzone, Orazio Gambino, Roberto Gallea,...
IJCNN
2008
IEEE
14 years 2 months ago
On the sample mean of graphs
— We present an analytic and geometric view of the sample mean of graphs. The theoretical framework yields efficient subgradient methods for approximating a structural mean and ...
Brijnesh J. Jain, Klaus Obermayer
SDM
2003
SIAM
110views Data Mining» more  SDM 2003»
13 years 9 months ago
Mixture Models and Frequent Sets: Combining Global and Local Methods for 0-1 Data
We study the interaction between global and local techniques in data mining. Specifically, we study the collections of frequent sets in clusters produced by a probabilistic clust...
Jaakko Hollmén, Jouni K. Seppänen, Hei...
CVPR
2005
IEEE
14 years 9 months ago
A Bayesian Approach to Unsupervised Feature Selection and Density Estimation Using Expectation Propagation
We propose an approximate Bayesian approach for unsupervised feature selection and density estimation, where the importance of the features for clustering is used as the measure f...
Shaorong Chang, Nilanjan Dasgupta, Lawrence Carin