Sciweavers

9719 search results - page 1713 / 1944
» Answer Set Optimization
Sort
View
ICDM
2010
IEEE
135views Data Mining» more  ICDM 2010»
15 years 4 months ago
Learning a Bi-Stochastic Data Similarity Matrix
An idealized clustering algorithm seeks to learn a cluster-adjacency matrix such that, if two data points belong to the same cluster, the corresponding entry would be 1; otherwise ...
Fei Wang, Ping Li, Arnd Christian König
ICDM
2010
IEEE
226views Data Mining» more  ICDM 2010»
15 years 4 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 ...
ICML
2010
IEEE
15 years 4 months ago
Comparing Clusterings in Space
This paper proposes a new method for comparing clusterings both partitionally and geometrically. Our approach is motivated by the following observation: the vast majority of previ...
Michael H. Coen, M. Hidayath Ansari, Nathanael Fil...
NAACL
2010
15 years 4 months ago
An Efficient Algorithm for Easy-First Non-Directional Dependency Parsing
We present a novel deterministic dependency parsing algorithm that attempts to create the easiest arcs in the dependency structure first in a non-directional manner. Traditional d...
Yoav Goldberg, Michael Elhadad
PKDD
2010
Springer
164views Data Mining» more  PKDD 2010»
15 years 4 months ago
Efficient Planning in Large POMDPs through Policy Graph Based Factorized Approximations
Partially observable Markov decision processes (POMDPs) are widely used for planning under uncertainty. In many applications, the huge size of the POMDP state space makes straightf...
Joni Pajarinen, Jaakko Peltonen, Ari Hottinen, Mik...
« Prev « First page 1713 / 1944 Last » Next »