Digital Library
Close Browse articles from a journal
 
<< previous    next >>
     Journal description
       All volumes of the corresponding journal
         All issues of the corresponding volume
           All articles of the corresponding issues
                                       Details for article 2 of 6 found articles
 
 
  A graph-based clustering algorithm in large transaction databases
 
 
Title: A graph-based clustering algorithm in large transaction databases
Author: Ning Chen
An Chen
Longxiang Zhou
Liu Lu
Appeared in: Intelligent data analysis
Paging: Volume 5 (2001) nr. 4 pages 327-338
Year: 2001-11-19
Contents: Clustering in transaction databases can find potentially useful patterns to improve the product profit. Unfortunately, most clustering algorithms based on metric distances are not appropriate for transaction data. In this paper, we study the problem of item clustering in large transaction databases. We first present a definition of similarity measure between items based on large itemsets presented in transaction databases, which not only captures the co-occurrence relationship of items but also remains insensitive to noise. We represent the similarity relationship by an undirected graph and transform the clustering problem into discovering connected components of the graph. We also discuss the evaluation of clustering quality and develop an automatic optimizer for the optimum thresholds search, finding the item clustering which optimizes the quality.
Publisher: IOS Press
Source file: Elektronische Wetenschappelijke Tijdschriften
 
 

                             Details for article 2 of 6 found articles
 
<< previous    next >>
 
 Koninklijke Bibliotheek - National Library of the Netherlands