128 search results - page 11 / 26 » On Mining Closed Sets in Multi-Relational Data |
KDD
2010
ACM
15 years 1 months ago
2010
ACM
Discovering frequent patterns from data is a popular exploratory technique in data mining. However, if the data are sensitive (e.g. patient health records, user behavior records) ...
105
click to vote
DEXA
2005
Springer
15 years 3 months ago
2005
Springer
In this paper we introduce a novel architecture for data processing, based on a functional fusion between a data and a computation layer. We show how such an architecture can be le...
PKDD
2007
Springer
15 years 3 months ago
2007
Springer
Frequent itemset mining assists the data mining practitioner in searching for strongly associated items (and transactions) in large transaction databases. Since the number of frequ...
89
Voted
KDD
2007
ACM
15 years 10 months ago
2007
ACM
Studies have shown that program comprehension takes up to 45% of software development costs. Such high costs are caused by the lack-of documented specification and further aggrava...
115
Voted
IDA
2002
Springer
14 years 9 months ago
2002
Springer
Levelwise algorithms (e.g., the Apriori algorithm) have been proved eective for association rule mining from sparse data. However, in many practical applications, the computation ...