The document proposes a framework called MultiComm to identify communities in multi-dimensional networks. MultiComm evaluates the affinity between items in the same or different dimensions to generate communities from seed items. It calculates visit probabilities for each item in each dimension and compares the values. Experiments on synthetic and real-world data suggest MultiComm can effectively find communities in multi-dimensional networks and outperforms other algorithms in accuracy. The framework is intended to discover related groups of users, authors, or other entities interacting across multiple network dimensions like tags, photos, and comments.

1. GLOBALSOFT TECHNOLOGIES
IEEE PROJECTS & SOFTWARE DEVELOPMENTS
IEEE FINAL YEAR PROJECTS|IEEE ENGINEERING PROJECTS|IEEE STUDENTS PROJECTS|IEEE
BULK PROJECTS|BE/BTECH/ME/MTECH/MS/MCA PROJECTS|CSE/IT/ECE/EEE PROJECTS
CELL: +91 98495 39085, +91 99662 35788, +91 98495 57908, +91 97014 40401
Visit: www.finalyearprojects.org Mail to:ieeefinalsemprojects@gmail.com
Multi Comm: Finding Community Structure in Multi-
Dimensional Networks
Abstract
The main aim of this paper is to develop a community discovery scheme in a multi-dimensional network
for data mining applications. In online social media, networked data consists of multiple
dimensions/entities such as users, tags, photos, comments, and stories. We are interested in finding a
group of users who interact significantly on these media entities. In a co-citation network, we are
interested in finding a group of authors who relate to other authors significantly on publication
information in titles, abstracts, and keywords as multiple dimensions/entities in the network. The main
contribution of this paper is to propose a framework (MultiComm)to identify a seed-based community
in a multi-dimensional network by evaluating the affinity between two items in the same type of entity
(same dimension)or different types of entities (different dimensions)from the network. Our idea is to
calculate the probabilities of visiting each item in each dimension, and compare their values to generate
communities from a set of seed items. In order to evaluate a high quality of generated communities by
the proposed algorithm, we develop and study a local modularity measure of a community in a multi -
dimensional network. Experiments based on synthetic and real -world data sets suggest that the
proposed framework is able to find a community effectively. Experimental results have also shown that
the performance of the proposed algorithm is better in accuracy than the other testing algorithms in
finding communities in multi-dimensional networks.
Existing system
The main aim of this paper is to develop a community discovery scheme in a multi-dimensional network
for data mining applications. In online social media, networked data consists of multiple
dimensions/entities such as users, tags, photos, comments, and stories. We are interested in finding a
group of users who interact significantly on these media entities. In a co-citation network, we are

2. interested in finding a group of authors who relate to other authors significantly on publication
information in titles, abstracts, and keywords as multiple dimensions/entities in the network.
Proposed system
The main contribution of this paper is to propose a framework (MultiComm)to identify a seed-based
community in a multi-dimensional network by evaluating the affinity between two items in the same
type of entity (same dimension)or different types of entities (different dimensions)from the network.
Our idea is to calculate the probabilities of visiting each item in each dimension, and compare their
values to generate communities from a set of seed items. In order to evaluate a high quality of
generated communities by the proposed algorithm, we develop and study a local modularity measure of
a community in a multi-dimensional network. Experiments based on synthetic and real-world data sets
suggest that the proposed framework is able to find a community effectively. Experimental results have
also shown that the performance of the proposed algorithm is better in accuracy than the other test ing
algorithms in finding communities in multi-dimensional networks.
SYSTEM CONFIGURATION:-
HARDWARE CONFIGURATION:-
 Processor - Pentium –IV
 Speed - 1.1 Ghz
 RAM - 256 MB(min)
 Hard Disk - 20 GB
 Key Board - Standard Windows Keyboard
 Mouse - Two or Three Button Mouse
 Monitor - SVGA
SOFTWARE CONFIGURATION:-
 Operating System : Windows XP
 Programming Language : JAVA
 Java Version : JDK 1.6 & above.