KNOWLEDGE-BASED INTERACTIVE POST

MINING OF ASSOCIATION RULES

USING ONTOLOGIES

SUBMITTED TO IT, VRSEC

A DISSERTATION/REPORT submitted in partial fulfillment

submitted by

THOTA S THRIVENI

128W1D5932

Under the Guidance of

P . RAMADEVI M.Tech

for the award of the degree

of

MASTERS IN TECHNOLOGY IN COMPUTER SCIENCE AND

TECHNOLOGY

V R SIDDHARTHA ENGINEERING COLLEGE

(AUTONOMOUS - AFFILIATED TO JNT U, KAKINADA)
KANURU, VIJAYAWADA-7
2012-13
 V.R.SIDDHARTHA ENGINEERING COLLEGE
(Affiliated to JNTUK: Kakinada, Approved by AICTE, Autonomous)
(An ISO certified and NBA accredited institution)
Kanuru, Vijayawada – 520007

CERTIFICATE

This is to certify that this report titled “KNOWLEDGE-BASED INT

ERACTIVE POST MINING OF ASSOCIATION RULES USING ONTOLOGIES”

is a bonafide record of work done by THOTA S THRIVENI under my guidance and

supervision and is submitted in partial fulfillment of the requirements for the award of the

degree of Master of Technology in Computer Science and Technology, V R

SIDDHARTHA EENGINEERNG COLLEGE (Autonomous under JNTUK) during

the year 2012-2013.

P. RAMA DEVI Dr.Techn.A.KOTESWARA RAO

Assistant Professor Professor & Head

Dept. of Information Technology Dept. of Information Technology

ii
 ACKNOWLEDGEMENT

First and foremost, I sincerely salute our esteemed institution V R SIDDHARTHA

ENGINEERING COLLEGE for giving me this opportunity for fulfilling my paper.

I am thankful to our Head of Department Dr.Techn.A.KOTESWARA RAO for his

constant encouragement and invaluable support throughout the course of the project.

I am glad to express my deep sense of gratitude to Ms. P.RAMA DEVI, M.Tech

Assistant professor, my guide, for his guidance and cooperation in completing this paper

successfully.

I thank one and all who have rendered help directly or indirectly in the

completion of this paper successfully.

iii
ACKNOWLEDGEMENT .......................................................................................
LIST OF FIGURES
ABSTRACT .......... ...... ............ ...... .................. ...... ............ ...... .................. ...............

CHAPTER
1.
1.1 History
1.2 Mining of Association Rules.......................................
1.3 Example......................................................................

2. LITERATURE SURVEY ........................................................................

2.1 Data Pruning ............................................................................
2.2 Text Mining ...............................................................................
2.3 The Scope of Data Mining .........................................................
2.4 How Data Mining Works ............................................................
2.5 Ontologies in Data Mining ........................................................
2.6 Frame Work ...............................................................................
2.7 Description of ARIPSO Framework ........................................
2.8 Interactive Post mining Process………………………………. 14

3. CONCLUSION ........................................................................................

REEES .............................................................................................................

iv
 LIST OF FIGURES

FIGURE PAGE

1. VISUALIZATION OF ONTOLOGY…….. ..................................................... 12

2. FRAMEWORK……………................................................................................ 13

3. INTERACTIVE POST MINING PROCESS …................................................. 14

v
 ABSTRACT

In Data Mining, the usefulness of association rules is strongly limited by the huge
amount of delivered rules. To overcome this drawback, several methods were proposed in
the literature such as item set concise representations, redundancy reduction, and post
processing. However, being generally based on statistical information, most of these
methods do not guarantee that the extracted rules are interesting for the user. Thus, it is
crucial to help the decision-maker with an efficient post processing step in order to
reduce the number of rules. This paper proposes a new interactive approach to prune and
filter discovered rules. First, we propose to use ontologies in order to improve the
integration of user knowledge in the post processing task. Second, we propose the Rule
Schema formalism extending the specification language proposed by Liu et al. for user
expectations. Furthermore, an interactive framework is designed to assist the user
throughout the analyzing task. Applying our new approach over voluminous sets of rules,
we were able, by integrating domain expert knowledge in the post processing step, to
reduce the number of rules to several dozens or less. Moreover, the quality of the filtered
rules was validated by the domain expert at various points in the interactive process.

vi
v
ii