Sciweavers

1300 search results - page 54 / 260
» Association Schemoids and Their Categories
Sort
View
KDD
2008
ACM
161views Data Mining» more  KDD 2008»
15 years 11 months ago
An inductive database prototype based on virtual mining views
We present a prototype of an inductive database. Our system enables the user to query not only the data stored in the database but also generalizations (e.g. rules or trees) over ...
Élisa Fromont, Adriana Prado, Bart Goethals...
KDD
2006
ACM
130views Data Mining» more  KDD 2006»
15 years 11 months ago
Discovering significant rules
In many applications, association rules will only be interesting if they represent non-trivial correlations between all constituent items. Numerous techniques have been developed ...
Geoffrey I. Webb
KDD
2004
ACM
148views Data Mining» more  KDD 2004»
15 years 11 months ago
Interestingness of frequent itemsets using Bayesian networks as background knowledge
The paper presents a method for pruning frequent itemsets based on background knowledge represented by a Bayesian network. The interestingness of an itemset is defined as the abso...
Szymon Jaroszewicz, Dan A. Simovici
CHI
2003
ACM
15 years 11 months ago
The evolution of buildings and implications for the design of ubiquitous domestic environments
This paper considers how we may realize future ubiquitous domestic environments. Building upon previous work on how buildings evolve by Stewart Brand, we suggest the need to broad...
Tom Rodden, Steve Benford
ICFP
2008
ACM
15 years 11 months ago
Type checking with open type functions
We report on an extension of Haskell with open type-level functions and equality constraints that unifies earlier work on GADTs, functional dependencies, and associated types. The...
Tom Schrijvers, Simon L. Peyton Jones, Manuel M. T...