INFORMATION RETRIEVAL SYSTEM

SIVA SREEDHARAN B

2013503525
INTRODUCTION:

Information Retrieval (IR) is essentially the requirement of documents in a collection that

should be retrieved to satisfy a users need for information. The users information requirement
is represented by a query or profile, and contains one or more search terms, plus perhaps some
additional information such importance weights.
In order to fetch the whole document, the document retrieval methods are used. Document
Retrieval is the computerized process of trading a list of documents that are appropriate to an
inquirers request by associating the users request to spontaneously produced index of the
textual content of documents in the system. There are a number of methods are used for the
retrieval of the documents such as clustering, indexing, page ranking, etc. Most of the methods
retrieve only the document that containing relevant data only, i.e. a document is fetched in
respective of the user query.

Information retrieval is the process of retrieving all the relevant documents that
satisfies the user query. Stemming is a technique which aims to obtain the root word by
removing the suffixes.The stemmed documents are inserted into Document Index Graph (DIG).
Document Index Graph is used for the ordered arrangement of the documents. The words with
same stem will be stored only once in DIG.The most frequently appearing words are put into FP
(Frequent Pattern) Tree. The FP-tree is a compact representation of all relevant frequently
occurring information in a database. The remaining infrequent words are stored in hash table.
The information retrieval system compares the query with documents in the FP-Tree. If found it
returns the related sentences and documents from DIG. If not found in FP-Tree the hash table is
referred and it returns the relevant sentences and documents from DIG.

ARCHITECTURE DIAGRAM FOR INFORMATION RETRIEVAL

SYSTEM

Modules
1: User Query Pre processing.

2: Document Index Graph (DIG) construction from the set of documents available in the
database.

3: FP-Tree Construction from the Document Index Graph .

4: Document retrieval from the Contructed Document.
5:Storing the set of documents that are available in the information retrieval
systems.

ALGORITHM
FREQUENALPATTERN TREE
1: Sort the items in the transaction database in descending order, according to
occurrence in transaction.

the number of

2: Create the root of the tree R.

3: for each transaction in transaction database do
4:The descending ordered transaction is represented by [p|Q], where p is the first item and Q is
rest of the items in transaction.
5:if p= the most frequent item then
6:if root R has a direct child node M, where Ms item_name = ps item_name then
7:Increase frequency of the item M, denoted as G.M by 1. Transfer the root from R to p.
8:for each item in Q do the following steps up to Q is empty.
9:Create a new node for each new item from root.
new item by 1.Transfer the root to new node.

Increase the frequency of the new item, G.

14:if an item, Qi has no single edge from the current root to its node, Where Qi is an item in Qm
and already exists in FP-tree then
15:Store spare item Qi with frequency 1 in spare table.
18: else for each item in transaction [p|Q] do
20:

Store all items in Stable with frequency 1.

21:end for
22:Calculate the total frequency of each item in stable, called Stable count.
23:Output the FP-tree, frequency of each item in FP-tree and total frequency of Stable Count.

TOOLS REQUIRED

ECLIPSE:
This tool is used to design the front end.

SOFTWARE REQUIREMENTS
Operating System

Microsoft Windows 7,8.

Front End

Java.

Back End

Oracle

INPUT
1 Query to search the relevant document in the Information Retrieval Systems.

OUTPUT
1. Display the List of Documents that matches the user query.
2. Display in the order , i.e First Document is the perfect match of the user query and second
most and goes on
LITERATURE SURVEY
1.
TITLE : Efficient Phrase-Based Document Indexing for Web Document Clustering.
Published by : Khaled M. Hammouda.
Published year : 2014
The first part of the paper describes a novel phrase-based document index model, the
Document Index Graph (DIG), which allows incremental construction of a phrase-based index of
the document set with an emphasis on efficiency, rather than relying on single-term indexes only.
The second part describes an incremental document clustering algorithm.This algorithm has five
major steps and hence it is time consuming.For large documents this stemmer is not efficient.
2.
TITLE :An Ontology-based augmented method for document retrieval.
Published by: Poonam Yadav and R.P.Singh.

Published Year:2014
In this paper an ontology-based augmented method for document retrieval system is
proposed. It also describes the way of performing data pre-processing to remove the stop words
and to perform stemming. It also deals with the extraction of concepts from documents. This
paper also adopts the indexing technique for the arrangements of the documents.
3.
TITLE : Mining Frequent Patterns without candidate generation.
Published by: jiawei han, jian pei and jiwen yin.
Published Year :2014
This paper describes an efficient FP-Tree based mining method. It also provides a
performance study that shoes that FP-growth method is efficient and scalable for mining both
long and short frequent patterns, and is about an order of magnitude faster than the apriori
algorithm and also faster than some recently reported new frequent pattern mining methods
4.
TITLE : Performance of query processing implementations in ranking-based text retrieval
systems using inverted indices.
Published by B. Barla Cambazoglu, Cevdet Aykanat.
Published Year:2013
This paper mainly concentrates on implementing efficient query processing techniques to
find the distinct terms over a large document collection. .For large documents this stemmer is not
efficient
5.
TITLE : Development of a stemming algorithm.
published by: Julie Beth Lovins
Published Year:2014
This paper that deals with a stemming algorithm to reduce all words with the same
stem to a common form. This paper explains several types of stemming algorithm with its
advantages and disadvantages. This paper also introduces a new version of context-sensitive,
longest match stemming algorithm called Lovins algorithm.

6.
TITLE: A Comparative Study of stemming algorithm.
published by: Anjali Ganesh Jivani.
Published year:2014
This paper discusses different methods of stemming and their comparisons in terms of
usage, the advantages as well as limitations. The classification of the stemming algorithms is
explained in detail. Comparisons between the stemming algorithms are done and its advantages
and dis-advantages about each stemming algorithm are described in this paper.
7.

TITLE : An improved frequent pattern tree based association rule mining technique.
Published by: A.B.M.Rezbaul Islam and Tae-Sun Chung.
Published Year : 2013
This paper proposed a new algorithm and improved Frequent Pattern (FP) Tree with a table
and a new algorithm for mining the association rule. This paper describes about mining the entire
possible frequent item set without generating the conditional FP-Tree. It also provides ways of
fining the frequency of the frequent items, which is used to estimate the desired association rule.
8.
TITLE: A topic based indexing approach for searching in documents
Published by: Ivan Lopez-Arevalo ; Victor Sosa-Sosa

Published Year:2012
This paper proposes a topic based indexing approach to represent topics associated
to documents. Documents are modeled by using clustering algorithms based on
natural language processing.The disadvantage of these models is that they
exclusively consider terms in the query and ignore similar terms.