ICDM
2002
IEEE
14 years 1 months ago
2002
IEEE
We describe an efficient framework for Web personalization based on sequential and non-sequential pattern discovery from usage data. Our experimental results performed on real us...
ICDM
2002
IEEE
14 years 1 months ago
2002
IEEE
Clustering large data sets of high dimensionality has always been a serious challenge for clustering algorithms. Many recently developed clustering algorithms have attempted to ad...
ICDM
2002
IEEE
14 years 1 months ago
2002
IEEE
Automatic classification of web pages is an effective way to deal with the difficulty of retrieving information from the Internet. Although there are many automatic classification...
ICDM
2002
IEEE
14 years 1 months ago
2002
IEEE
Frequent pattern mining has been studied extensively. However, the effectiveness and efficiency of this mining is often limited, since the number of frequent patterns generated i...
ICDM
2002
IEEE
14 years 1 months ago
2002
IEEE
ICDM
2002
IEEE
14 years 1 months ago
2002
IEEE
Over the years, a variety of algorithms for finding frequent sequential patterns in very large sequential databases have been developed. The key feature in most of these algorith...
ICDM
2002
IEEE
14 years 1 months ago
2002
IEEE
ICDM
2002
IEEE
14 years 1 months ago
2002
IEEE
ICDM
2002
IEEE
14 years 1 months ago
2002
IEEE
ICDM
2002
IEEE
14 years 1 months ago
2002
IEEE
Mining frequent patterns with an FP-tree avoids costly candidate generation and repeatedly occurrence frequency checking against the support threshold. It therefore achieves bette...