Sciweavers

11160 search results - page 203 / 2232
» Incompleteness in a General Setting
Sort
View
TKDE
2012
253views Formal Methods» more  TKDE 2012»
13 years 6 months ago
Horizontal Aggregations in SQL to Prepare Data Sets for Data Mining Analysis
—Preparing a data set for analysis is generally the most time consuming task in a data mining project, requiring many complex SQL queries, joining tables and aggregating columns....
Carlos Ordonez, Zhibo Chen 0002
COMPGEOM
2010
ACM
15 years 9 months ago
On degrees in random triangulations of point sets
We study the expected number of interior vertices of degree i in a triangulation of a point set S, drawn uniformly at random from the set of all triangulations of S, and derive va...
Micha Sharir, Adam Sheffer, Emo Welzl
CINQ
2004
Springer
118views Database» more  CINQ 2004»
15 years 9 months ago
Boolean Formulas and Frequent Sets
We consider the problem of how one can estimate the support of Boolean queries given a collection of frequent itemsets. We describe an algorithm that truncates the inclusion-exclus...
Jouni K. Seppänen, Heikki Mannila
SAC
2010
ACM
15 years 9 months ago
Mining interesting sets and rules in relational databases
In this paper we propose a new and elegant approach toward the generalization of frequent itemset mining to the multirelational case. We define relational itemsets that contain i...
Bart Goethals, Wim Le Page, Michael Mampaey
LPNMR
2009
Springer
15 years 9 months ago
On Reductive Semantics of Aggregates in Answer Set Programming
Several proposals of the semantics of aggregates are based on different extensions of the stable model semantics, which makes it difficult to compare them. In this note, building ...
Joohyung Lee, Yunsong Meng