Bapuji Rao

Bapuji Rao

Auto-generated profile, based on publicly available information

Bapuji Rao

Indira Gandhi Institute of Technology, Sarang, India

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 December 2014
Verified
Conference Paper
Closed access
BRBapuji Rao
Bapuji Rao
AMAnirban Mitra
Anirban Mitra
Community effect and inter community communication and relationship is one of the important aspects of social network analysis. Studying community detection and analyzing the behaviors of the communities can give us information about the group as well as about the actors in the group. Using graph mining techniques, knowledge extraction is possible from the community graph. In our work, we started with the discussion on related definitions and some of the available algorithms for community detection in social network. Further, we propose a new and simple algorithm for finding the community detection in a social network using graph techniques. An example verifies about the strength of the proposed algorithm.

1 January 2017 in International Journal of Rough Sets and Data Analysis
Verified
Journal Article
Closed access
PDF file
BRBapuji Rao
Bapuji Rao
BMBrojo Mishra
Brojo Mishra
This paper introduces a new approach of clustering of text documents based on a set of words using graph mining techniques. The proposed approach clusters (groups) those text documents having searched successfully for the given set of words from a set of given text documents. The document-word relation can be represented as a bi-partite graph. All the clustering of text documents is represented as sub-graphs. Further, the paper proposes an algorithm for clustering of text documents for a given set of words. It is an automated system and requires minimal human interaction for the clustering of text documents. The algorithm has been implemented using C++ programming language and observed satisfactory results.

1 December 2014
Verified
Conference Paper
Closed access
BRBapuji Rao
Bapuji Rao
AMAnirban Mitra
Anirban Mitra
Data mining is known for discovering frequent sub-structures. After finding certain similarity, it is easy to merge the sub-structures to form a larger structure for proper information extraction. To carry out this process, we have proposed new algorithms which merge two community subgraphs in an efficient and simpler way. For our work, we have followed graph matching technique by matching one-to-one correspondence. The three algorithms that have been proposed in this paper are, the first algorithm explains about finding the order of merged communities and to make available of initial form of merged community matrix. The second algorithm explains about creation of adjacency matrix community graph and the third algorithm uses the adjacency matrices of community graph and explains about creation of merged community adjacency matrix. Further, we have verified our proposed approach by implementing it. An appropriate example with the set of input and obtained outputs has been explained. The obtained results are satisfactory. The results were obtained after execution of our programs. Snap-shot of the program output have been included in the paper.


1 December 2016
Verified
Conference Paper
Closed access
BRBapuji Rao
Bapuji Rao
HMH. S. Maharana
H. S. Maharana
SMS. N. Mishra
S. N. Mishra
Finding of frequent sub-graphs is an important operation on graphs and it is defined as detection of all sub-graphs that appear frequently in a set of graphs. This paper proposes detection of frequent sub-community graph from n-set of community graph of villages; are useful for characterizing community graph sets, finding difference among groups of community graphs, classifying and clustering of community graphs, and building community graph indices leading to knowledge extraction. The given n-community graphs of villages and the sub-community graph, which is to be detected are first represented as adjacency matrices. Then the sub-community graph adjacency matrix is compared with the n-community graph's adjacency matrices sequentially. The paper concludes with analysis of the proposed algorithm using graph mining techniques with supportive example, satisfactory results and screenshots.

1 January 2015 in Procedia Computer Science
Verified
Journal Article
Open access
BRBapuji Rao
Bapuji Rao
AMAnirban Mitra
Anirban Mitra
JMJayanta Mondal
Jayanta Mondal
Community detection is the one of the most relevant and important topics in the field of graph mining, principally for its applications in number of domains such as social or biological networks analysis to transport systems. Different community detection algorithms have been proposed earlier. This paper discusses and proposes a new technique on particular community detection and its retrieval in social community graph. Community detection constitutes a significant role for analysis of a large community graph by enabling and selecting the desired community's graph. It tries to extract a sub-community graph from a very large community graph for analysis. This paper presents both a theoretical and experimental result in this direction with certain example. We have retrieved the sub-community graph from a compressed community graph in the context of graph mining techniques. Observation concludes that the proposed technique is simpler, easier and efficient in terms of complexities