Sciweavers

32 search results - page 3 / 7
» Estimation and clustering with infinite rankings
Sort
View
ICDE
2009
IEEE
156views Database» more  ICDE 2009»
14 years 6 months ago
Distributed Structural Relaxation of XPath Queries
Due to the structural heterogeneity of XML, queries are often interpreted approximately. This is achieved by relaxing the query and ranking the results based on their relevance to ...
Georgia Koloniari, Evaggelia Pitoura
EMNLP
2008
13 years 6 months ago
One-Class Clustering in the Text Domain
Having seen a news title "Alba denies wedding reports", how do we infer that it is primarily about Jessica Alba, rather than about weddings or reports? We probably reali...
Ron Bekkerman, Koby Crammer
JMLR
2010
184views more  JMLR 2010»
12 years 11 months ago
Sequential Monte Carlo Samplers for Dirichlet Process Mixtures
In this paper, we develop a novel online algorithm based on the Sequential Monte Carlo (SMC) samplers framework for posterior inference in Dirichlet Process Mixtures (DPM) (DelMor...
Yener Ülker, Bilge Günsel, Ali Taylan Ce...
ICASSP
2008
IEEE
13 years 11 months ago
Nested support vector machines
The one-class and cost-sensitive support vector machines (SVMs) are state-of-the-art machine learning methods for estimating density level sets and solving weighted classificatio...
Gyemin Lee, Clayton Scott
ICPR
2002
IEEE
13 years 9 months ago
Uniformity Testing Using Minimal Spanning Tree
Testing for uniformity of multivariate data is the initial step in exploratory pattern analysis. We propose a new uniformity testing method, which first computes the maximum (sta...
Anil K. Jain, Xiaowei Xu, Tin Kam Ho, Fan Xiao