141 search results - page 3 / 29 » Hierarchical Document Clustering using Frequent Itemsets |
SBACPAD
2003
IEEE
13 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...
CINQ
2004
Springer
13 years 10 months ago
2004
Springer
Inductive databases (IDBs) have been proposed to afford the problem of knowledge discovery from huge databases. With an IDB the user/analyst performs a set of very different operat...
ECML
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. In order to organize huge document collections, labeled hierarchical structures are used frequently. Users are most efficient in navigating such hierarchies, if they refl...
WWW
2005
ACM
13 years 11 months ago
2005
ACM
In this paper, we propose an approach to materialize XML data warehouses based on the frequent query patterns discovered from historical queries issued by users. The schemas of in...
DKE
2007
13 years 6 months ago
2007
A major challenge in frequent-pattern mining is the sheer size of its mining results. To compress the frequent patterns, we propose to cluster frequent patterns with a tightness m...