822 search results - page 3 / 165 » Case Mining from Large Databases |
ICTAI
2003
IEEE
13 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...
KDD
2006
ACM
14 years 6 months ago
2006
ACM
Frequent coherent subgraphscan provide valuable knowledgeabout the underlying internal structure of a graph database, and mining frequently occurring coherent subgraphs from large...
ICDE
2008
IEEE
14 years 7 months ago
2008
IEEE
Mining frequent itemsets from data streams has proved to be very difficult because of computational complexity and the need for real-time response. In this paper, we introduce a no...
KDD
2002
ACM
14 years 6 months ago
2002
ACM
In this paper we propose a scaling-up method that is applicable to essentially any induction algorithm based on discrete search. The result of applying the method to an algorithm ...
IADIS
2008
13 years 7 months ago
2008
Marketing databases are currently one of the most important resources in any marketing departments. Regarding their customer knowledge needs many of them had develop their own dat...