Sciweavers

1285 search results - page 197 / 257
» On the Complexity of Ordinal Clustering
Sort
View
ICML
2008
IEEE
14 years 9 months ago
Training structural SVMs when exact inference is intractable
While discriminative training (e.g., CRF, structural SVM) holds much promise for machine translation, image segmentation, and clustering, the complex inference these applications ...
Thomas Finley, Thorsten Joachims
ICML
2008
IEEE
14 years 9 months ago
Expectation-maximization for sparse and non-negative PCA
We study the problem of finding the dominant eigenvector of the sample covariance matrix, under additional constraints on the vector: a cardinality constraint limits the number of...
Christian D. Sigg, Joachim M. Buhmann
WWW
2008
ACM
14 years 9 months ago
Personalized view-based search and visualization as a means for deep/semantic web data access
Effective access to and navigation in information stored in deep Web ontological repositories or relational databases has yet to be realized due to issues with usability of user i...
Mária Bieliková, Michal Tvarozek
WWW
2004
ACM
14 years 9 months ago
Graph-based text database for knowledge discovery
While we expect to discover knowledge in the texts available on the Web, such discovery usually requires many complex analysis steps, most of which require different text handling...
Junji Tomita, Hidekazu Nakawatase, Megumi Ishii
KDD
2006
ACM
115views Data Mining» more  KDD 2006»
14 years 9 months ago
Aggregating time partitions
Partitions of sequential data exist either per se or as a result of sequence segmentation algorithms. It is often the case that the same timeline is partitioned in many different ...
Evimaria Terzi, Panayiotis Tsaparas, Taneli Mielik...