1. Efficient Approach of Patent Search
Paradigm
Final year Project Abstract
by – Prateek Kumar
1031010186
SRM University

2. ABSTRACT
 For Intellectual property protection, patents play an important role.
 Patent search is used for finding existing relevant patents and
validating a new patent application.
 Many users have limited knowledge about the underlying patents, and
they have to use a try-and-see approach to repeatedly issue different
queries and check answers.
 To overcome this problem our proposed system introduces a new userfriendly approach for patent search .
 Proposed system uses three efficient techniques to improve the
usability of patent search: error correction, Topic-based query
suggestion and query expansion.
 First partition the patents into small partitions based to their topics and
classes. Then find highly relevant partitions and answer the query in
highly relevant partitions. Finally combine the answers of each
partition and generate top answers of the patent-search query.

3. EXISTING SYSTEM
 Existing methods focus on devising a complicated ranking
model to rank patents and finding the most relevant answers.
 Do not pay enough attention to effectively capturing users
search intention, which is at least as important as ranking
patents.
 If users query keywords may have typing error, existing
methods will return no answer as they cannot find patents
matching query keywords.
 Existing method neglect the fact that the search efficiency.

4. DRAWBACK IN EXISTING SYSTEM
No error correction
Complicated ranking model
Neglected search efficiency
No query expansion

5. EXISTING TECHNIQUE
Ranking model - leads to produce irrelevant
patents at the result of patent search.

6. PROPOSED SYSTEM
 This project can help users find relevant patents more
easily and improve user search experience.
 To overcome the typing error problem in existing system
our project introduces the error correction technique.
 For improving efficiency partition the patents into small
partitions based to their topics and classes. Then given a
query and find highly relevant partitions and answer the
query in each of such highly relevant partitions.
 Finally combine the answers of each partition and
generate top answers of the patent-search query.

7. ADVANTAGES IN PROPOSED
SYSTEM
Keyword error correction
Partition based patent search
High search efficiency
Query suggestion and expansion

8. PROPOSED TECHNIQUE
Error correction
Topic-based query suggestion
Query expansion

9. SYSTEM REQUIREMENTS
HARDWARE
PROCESSOR:
RAM:
MONITOR:
HARD DISK:
PENTIUM IV
2.6 GHz, Intel Core 2 Duo.
512 MB DD RAM
15” COLOR
40 GB

10. SOFTWARE
FRONT END:
BACK END:
OPERATING
SYSTEM:
IDE:
JSP Servlets
MS SQL 05
Windows 07
Net Beans, Eclipse

11. FUTURE ENHANCEMENT
 In future, our proposed patent search paradigm will connect
large number of database.
 Increase the efficiency and search ability of patents with
user friendly approach.

12. THANK YOU
- Prateek Kumar