Sciweavers

1403 search results - page 13 / 281
» Set cover algorithms for very large datasets
Sort
View
COLING
2010
13 years 3 months ago
Enhancing Cross Document Coreference of Web Documents with Context Similarity and Very Large Scale Text Categorization
Cross Document Coreference (CDC) is the task of constructing the coreference chain for mentions of a person across a set of documents. This work offers a holistic view of using do...
Jian Huang 0002, Pucktada Treeratpituk, Sarah M. T...
ICONIP
2007
13 years 9 months ago
Using Generalization Error Bounds to Train the Set Covering Machine
In this paper we eliminate the need for parameter estimation associated with the set covering machine (SCM) by directly minimizing generalization error bounds. Firstly, we consider...
Zakria Hussain, John Shawe-Taylor
VLDB
1998
ACM
136views Database» more  VLDB 1998»
14 years 19 days ago
Materialized View Selection for Multidimensional Datasets
To fulfill the requirement of fast interactive multidimensional data analysis, database systems precompute aggregate views on some subsets of dimensions and their corresponding hi...
Amit Shukla, Prasad Deshpande, Jeffrey F. Naughton
MLDM
2005
Springer
14 years 1 months ago
Clustering Large Dynamic Datasets Using Exemplar Points
In this paper we present a method to cluster large datasets that change over time using incremental learning techniques. The approach is based on the dynamic representation of clus...
William Sia, Mihai M. Lazarescu
ORL
2011
13 years 3 months ago
Solving large Steiner Triple Covering Problems
Computing the 1-width of the incidence matrix of a Steiner Triple System gives rise to small set covering instances that provide a computational challenge for integer programming ...
James Ostrowski, Jeff Linderoth, Fabrizio Rossi, S...