2962 search results - page 441 / 593 » Reasoning on Association Rules |
166
click to vote
ICTAI
2003
IEEE
15 years 11 months ago
2003
IEEE
In this paper, we propose a parallel algorithm for mining maximal frequent itemsets from databases. A frequent itemset is maximal if none of its supersets is frequent. The new par...
161
click to vote
RIDE
2003
IEEE
15 years 11 months ago
2003
IEEE
In this paper, we present a scheme for identifying instances of events and extracting information about them. The scheme can handle all events with which an action can be associat...
204
click to vote
SBACPAD
2003
IEEE
15 years 11 months ago
2003
IEEE
Frequent itemset mining is a classic problem in data mining. It is a non-supervised process which concerns in finding frequent patterns (or itemsets) hidden in large volumes of d...
173
click to vote
APWEB
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. We present WBext (Web Browser extended), a web browser extended with client-side mining capabilities. WBext learns sophisticated user interests and browsing habits by tai...
163
click to vote
AUSAI
2003
Springer
15 years 11 months ago
2003
Springer
Efficient mining of frequent patterns from large databases has been an active area of research since it is the most expensive step in association rules mining. In this paper, we pr...