Sciweavers

180 search results - page 12 / 36
» Unsupervised Relation Disambiguation Using Spectral Clusteri...
Sort
View
ICONIP
2008
13 years 9 months ago
Comparison of Cluster Algorithms for the Analysis of Text Data Using Kolmogorov Complexity
In this paper we present a comparison of multiple cluster algorithms and their suitability for clustering text data. The clustering is based on similarities only, employing the Kol...
Tina Geweniger, Frank-Michael Schleif, Alexander H...
ACL
2009
13 years 5 months ago
Profile Based Cross-Document Coreference Using Kernelized Fuzzy Relational Clustering
Coreferencing entities across documents in a large corpus enables advanced document understanding tasks such as question answering. This paper presents a novel cross document core...
Jian Huang 0002, Sarah M. Taylor, Jonathan L. Smit...
DAGM
2011
Springer
12 years 7 months ago
Relaxed Exponential Kernels for Unsupervised Learning
Many unsupervised learning algorithms make use of kernels that rely on the Euclidean distance between two samples. However, the Euclidean distance is optimal for Gaussian distribut...
Karim T. Abou-Moustafa, Mohak Shah, Fernando De la...
IRCDL
2007
13 years 9 months ago
An Hybrid Approach for Improving Word Sense Disambiguation and Text Clustering
Abstract— In this paper we suggest a new approach to represent text document collections, integrating background knowledge to improve clustering effectiveness. Background knowled...
Paolo Casoto, Carlo Tasso
ICCV
2007
IEEE
14 years 9 months ago
Noise Robust Spectral Clustering
This paper aims to introduce the robustness against noise into the spectral clustering algorithm. First, we propose a warping model to map the data into a new space on the basis o...
Zhenguo Li, Jianzhuang Liu, Shifeng Chen, Xiaoou T...