7988 search results - page 1048 / 1598 » A Useful Undecidable Theory |
226
click to vote
KDD
2008
ACM
16 years 7 months ago
2008
ACM
Transactional data are ubiquitous. Several methods, including frequent itemsets mining and co-clustering, have been proposed to analyze transactional databases. In this work, we p...
219
click to vote
KDD
2007
ACM
16 years 7 months ago
2007
ACM
Characterising the differences between two databases is an often occurring problem in Data Mining. Detection of change over time is a prime example, comparing databases from two b...
184
click to vote
KDD
2004
ACM
16 years 7 months ago
2004
ACM
Kernel k-means and spectral clustering have both been used to identify clusters that are non-linearly separable in input space. Despite significant research, these methods have re...
192
click to vote
KDD
2004
ACM
16 years 7 months ago
2004
ACM
Procedures for collective inference make simultaneous statistical judgments about the same variables for a set of related data instances. For example, collective inference could b...
194
click to vote
CHI
2008
ACM
16 years 7 months ago
2008
ACM
We study the development of common ground in an emergency management planning task. Twelve three-person multi-role teams performed the task with a paper prototype in a controlled ...