Sciweavers

1601 search results - page 192 / 321
» Closed Sets for Labeled Data
Sort
View
DBPL
2009
Springer
144views Database» more  DBPL 2009»
16 years 1 months ago
General Database Statistics Using Entropy Maximization
Abstract. We propose a framework in which query sizes can be estimated from arbitrary statistical assertions on the data. In its most general form, a statistical assertion states t...
Raghav Kaushik, Christopher Ré, Dan Suciu
PKDD
2007
Springer
147views Data Mining» more  PKDD 2007»
16 years 17 days ago
MINI: Mining Informative Non-redundant Itemsets
Frequent itemset mining assists the data mining practitioner in searching for strongly associated items (and transactions) in large transaction databases. Since the number of frequ...
Arianna Gallo, Tijl De Bie, Nello Cristianini
AUSDM
2006
Springer
91views Data Mining» more  AUSDM 2006»
15 years 10 months ago
Towards Automated Record Linkage
The field of Record Linkage is concerned with identifying records from one or more datasets which refer to the same underlying entities. Where entity-unique identifiers are not av...
Karl Goiser, Peter Christen
IDA
2002
Springer
15 years 6 months ago
Optimization of association rule mining queries
Levelwise algorithms (e.g., the Apriori algorithm) have been proved eective for association rule mining from sparse data. However, in many practical applications, the computation ...
Baptiste Jeudy, Jean-François Boulicaut
ICASSP
2011
IEEE
14 years 10 months ago
A subject-independent acoustic-to-articulatory inversion
Acoustic-to-articulatory inversion is usually done in a subjectdependent manner, i.e., the inversion procedure may not work well if the parallel acoustic and articulatory training...
Prasanta Kumar Ghosh, Shrikanth S. Narayanan