Sciweavers

47 search results - page 7 / 10
» Beginnings of a Theory of General Database Completions
Sort
View
KDD
2009
ACM
168views Data Mining» more  KDD 2009»
14 years 2 months ago
Cartesian contour: a concise representation for a collection of frequent sets
In this paper, we consider a novel scheme referred to as Cartesian contour to concisely represent the collection of frequent itemsets. Different from the existing works, this sche...
Ruoming Jin, Yang Xiang, Lin Liu
PSD
2010
Springer
108views Database» more  PSD 2010»
13 years 6 months ago
Disclosure Risk of Synthetic Population Data with Application in the Case of EU-SILC
In survey statistics, simulation studies are usually performed by repeatedly drawing samples from population data. Furthermore, population data may be used in courses on survey sta...
Matthias Templ, Andreas Alfons
CIKM
2005
Springer
14 years 1 months ago
MailRank: using ranking for spam detection
Can we use social networks to combat spam? This paper investigates the feasibility of MailRank, a new email ranking and classification scheme exploiting the social communication ...
Paul-Alexandru Chirita, Jörg Diederich, Wolfg...
CIKM
2010
Springer
13 years 6 months ago
Third workshop on exploiting semantic annotations in information retrieval (ESAIR): CIKM 2010 workshop
There is an increasing amount of structure on the Web as a result of modern Web languages, user tagging and annotation, and emerging robust NLP tools. These meaningful, semantic, ...
Jaap Kamps, Jussi Karlgren, Ralf Schenkel
PODS
2007
ACM
142views Database» more  PODS 2007»
14 years 8 months ago
Quasi-inverses of schema mappings
Schema mappings are high-level specifications that describe the relationship between two database schemas. Two operators on schema mappings, namely the composition operator and th...
Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, Wa...