BOOKS
BOOK SERIES
JOURNALS
PROCEEDINGS
TEACHING CASES
PAY-PER-VIEW
REFERENCE
E-RESOURCES
ABOUT IGI
BECOME AN AUTHOR/EDITOR  |   MAILING LIST  |   HOW TO ORDER  |   LIBRARY SUGGESTION | EXAMINATION REQUESTS/COURSE ADOPTION | DISTRIBUTORS
IGI Online Bookstore
Click here to PLAY Demo Click here to Start Search Search 30,000+ chapters, articles, and cases - available for download today!

IGI Global Online Symposium!



  Browse Our Bookstore
IGI Catalogs & Newsletters
Forthcoming Titles
Featured Book
By Category
Advanced Search

  Shop
My Profile
View My Cart

  Contact Us
IGI Global
Main Office
701 E. Chocolate Avenue
Hershey, PA 17033, USA
Tel: 717-533-8845 x100
Toll Free: 1-866-342-6657
Fax: 717-533-8661
    or 717-533-7115
 

Preference-Based Frequent Pattern Mining:
Our Price:    $30.00 US
Article #:    ITJ2949
Pages:    56 - 77
Source:    International Journal of Data Warehousing and Mining, Vol. 1, Issue 4
Author(s):    Cho, Moonjung; Pei, Jian; Wang, Haixun; Wang, Wei
Affiliation(s):    University of Buffalo, USA; Simon Fraser University, Canada; IBM, T.J. Watson Research Center, USA; Fudan University, China

Order Now! This document will be delivered electronically. Terms of Delivery
 

Description
Frequent pattern mining is an important data-mining problem with broad applications. Although there are many in-depth studies on efficient frequent pattern mining algorithms and constraint pushing techniques, the effectiveness of frequent pattern mining remains a serious concern: It is non-trivial and often tricky to specify appropriate support thresholds and proper constraints. In this paper, we propose a novel theme of preference-based frequent pattern mining. A user simply can specify a preference instead of setting detailed parameters in constraints. We identify the problem of preference-based frequent pattern mining and formulate the preferences for mining. We develop an efficient framework to mine frequent patterns with preferences. Interestingly, many preferences can be pushed deep into the mining by properly employing the existing efficient frequent pattern mining techniques. We conduct an extensive performance study to examine our method. The results indicate that preference-based frequent pattern mining is effective and efficient. Furthermore, we extend our discussion from pattern-based frequent pattern mining to preference-based data mining in principle and draw a general framework.

 
Books  |  Book Series  |  Journals  |  Proceedings  |  Teaching Cases  |  Pay-Per-View  |  Reference  |  E-Resources  |  About IGI
Become An Author/Editor  |  Mailing List  |  How To Order  |  Library Suggestion  |  Examination Requests

IGI Global - All Rights Reserved ©2001-2010