Associative categorization of frequent patterns based on the probabilistic graphical model

2014 
Discovering the hierarchical structures of different classes of object behaviors can satisfy the requirements of various degrees of abstraction in association analysis, behavior modeling, data preprocessing, pattern recognition and decision making, etc. In this paper, we call this process as associative categorization, which is different from classical clustering, associative classification and associative clustering. Focusing on representing the associations of behaviors and the corresponding uncertainties, we propose the method for constructing a Markov network (MN) from the results of frequent pattern mining, called item-associative Markov network (IAMN), where nodes and edges represent the frequent patterns and their associations respectively. We further discuss the properties of a probabilistic graphical-model to guarantee the IAMN’s correctness theoretically. Then, we adopt the concept of chordal to reflect the closeness of nodes in the IAMN. Adopting the algorithm for constructing join trees from an MN, we give the algorithm for IAMN-based associative categorization by hierarchical bottom-up aggregations of nodes. Experimental results show-the effectiveness, efficiency and correctness of our methods.
    • Correction
    • Source
    • Cite
    • Save
    • Machine Reading By IdeaReader
    28
    References
    2
    Citations
    NaN
    KQI
    []