Sciweavers

329 search results - page 48 / 66
» Exact Algorithms and Experiments for Hierarchical Tree Clust...
Sort
View
ICDE
2007
IEEE
170views Database» more  ICDE 2007»
15 years 11 months ago
Tree-Pattern Similarity Estimation for Scalable Content-based Routing
With the advent of XML as the de facto language for data publishing and exchange, scalable distribution of XML data to large, dynamic populations of consumers remains an important...
Raphaël Chand, Pascal Felber, Minos N. Garofa...
ECIR
2006
Springer
14 years 11 months ago
Improving Quality of Search Results Clustering with Approximate Matrix Factorisations
Abstract. In this paper we show how approximate matrix factorisations can be used to organise document summaries returned by a search engine into meaningful thematic categories. We...
Stanislaw Osinski
ICDM
2009
IEEE
132views Data Mining» more  ICDM 2009»
15 years 4 months ago
Bayesian Overlapping Subspace Clustering
Given a data matrix, the problem of finding dense/uniform sub-blocks in the matrix is becoming important in several applications. The problem is inherently combinatorial since th...
Qiang Fu, Arindam Banerjee
NIPS
2003
14 years 11 months ago
Learning the k in k-means
When clustering a dataset, the right number k of clusters to use is often not obvious, and choosing k automatically is a hard algorithmic problem. In this paper we present an impr...
Greg Hamerly, Charles Elkan
INFORMS
2008
241views more  INFORMS 2008»
14 years 9 months ago
Solving the Capacitated Local Access Network Design Problem
We propose an exact solution method for a routing and capacity installation problem in networks. Given an input graph, the problem is to route traffic from a set of source nodes t...
F. Sibel Salman, R. Ravi, John N. Hooker