106 search results - page 17 / 22 » Finding Interesting Associations without Support Pruning |
77
Voted
SIGSOFT
2009
ACM
15 years 10 months ago
2009
ACM
Software engineering researchers have long been interested in where and why bugs occur in code, and in predicting where they might turn up next. Historical bug-occurence data has ...
102
click to vote
WWW
2003
ACM
15 years 10 months ago
2003
ACM
This paper describes a novel approach for obtaining semantic interoperability among data sources in a bottom-up, semiautomatic manner without relying on pre-existing, global seman...
VLDB
2004
ACM
15 years 3 months ago
2004
ACM
Large boolean matrices are a basic representational unit in a variety of applications, with some notable examples being interactive visualization systems, mining large graph struc...
84
Voted
FSS
2006
14 years 10 months ago
2006
Among the various extensions to the common [0, 1]-valued truth degrees of "traditional" fuzzy set theory, closed intervals of [0, 1] stand out as a particularly appealin...
148
click to vote
PODS
2009
ACM
15 years 10 months ago
2009
ACM
The problem of finding heavy hitters and approximating the frequencies of items is at the heart of many problems in data stream analysis. It has been observed that several propose...