CALL FOR PAPERS

Author Information

CERTIFICATE

IMPACT FACTOR 2021

Subject Area

Life Sciences / Biology
Architecture / Building Management
Asian Studies
Business & Management
Chemistry
Computer Science
Economics & Finance
Engineering / Acoustics
Environmental Science
Agricultural Sciences
Pharmaceutical Sciences
General Sciences
Materials Science
Mathematics
Medicine
Nanotechnology & Nanoscience
Nonlinear Science
Chaos & Dynamical Systems
Physics
Social Sciences & Humanities

Why Us? >>

Open Access
Peer Reviewed
Rapid Publication
Life time hosting
Free promotion service
Free indexing service
More citations
Search engine friendly

Plagiarism Detection

IJCR is following an instant policy on rejection those received papers with plagiarism rate of more than 20%. So, All of authors and contributors must check their papers before submission to making assurance of following our anti-plagiarism policies.

Retrieving similarity set using sub graph approach

Author:

Ravi Chinapaga, Harshitha, G., Bal Raju, M. and Subhash Chandra, N.

Subject Area:

Physical Sciences and Engineering

Abstract:

In graphs like social networks, Semantic Web and biological networks, every vertex has high information, which can be design by a set of tokens or elements. In this paper, we are studying about. Retrieving similarity set using sub graph approach, which gives subgraph that is structurally isomorphic to the query. Here we apply the apriori algorithm to find sub transaction set for actual transaction set in with each item get separated depending upon the category they are, which accomplish the frequent item set with its dynamic weight. In this we design a lightweight signature for both query vertices and data vertices. Structure-based pruning, which accomplishment the individual features of both (dynamic) weighted set similarity. We design an efficient algorithm to perform sub graph matching based on the dominating set of query graph.

PDF file: