Associative classification using patterns from nested granules
by Thomas W.H. Lui, David K.Y. Chiu
International Journal of Granular Computing, Rough Sets and Intelligent Systems (IJGCRSIS), Vol. 1, No. 4, 2010

Abstract: To facilitate interpretation and consider the internal association relationships between values of a pattern used in associative classification, a new form of multiple value pattern known as nested high-order pattern (NHOP) is presented. Taking an associative pair as information granule, the pattern is formed as multiple levels of association events. The general form of high-order pattern (HOP), that NHOP is a subtype, is identified as variable outcomes extracted from a random N-tuple. The pattern is detected by statistical testing if the occurrence is significantly deviated from the expected according to a prior model or null hypothesis. In this paper, we propose a classification method (called C-NHOP) based on nested high-order patterns. The rationale is that complex association patterns reinforce the underlying meaningfulness in interpreting regularity, thus, can provide a better understanding of the data domain. In evaluating our method using 26 UCI machine learning benchmark datasets, the experiments show a highly competitive and interpretable result.

Online publication date: Sat, 20-Nov-2010

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Granular Computing, Rough Sets and Intelligent Systems (IJGCRSIS):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email