You are on page 1of 4

International Journal of Computer Trends and Technology (IJCTT) volume 4 Issue 9 Sep 2013

ISSN: 2231-2803 Page 3028

Sparse Social Domains Based Scalable Learning of
Collective Behaviour
Lavanya Sudula
, K. Chandra Sekhar Reddy
, Prof.S.V.Achutha Rao
pursuing M.Tech(CSE) from Vikas College of Engineering and Technology, Nunna, Vijayawada. Affiliated to JNTU-Kakinada,
A.P, India.
working an Asst Professor at Vikas College of Engineering and Technology, Nunna, Vijayawada, India.
working as a Professor & Head Department of CSE at Vikas College of Engineering and Technology, Nunna, Vijayawada,

AbstractSocial networking is process where many
people get connected with each other share their views
and images. Social Networking has become very
important these days where many people get connected
globally, every individual today has an social networking
site account for example we can consider Facebook
which has gained a lot of importance when compared to
other social networking sites. We have many social
networking domains available in the market like
Facebook, Twitter, Linkedin and many others. Social
Network is good and interesting at the other side it is
insecure also. Now a days social network accounts are
hacked so it is very important for every individual to
logout properly in the system where they have used the
network and also they should not share their account
details with anyone which may lead to illegal issues. In
this paper we are performing a scalable learning of a
particular user through the usage of their social network
and also giving a report like the main purpose for which
the social network site was used by that user. Apart from
the scalable learning we are also checking with the access
control in the social networks where a user can share
their views or images or videos to a specific group or to
friends secretly. As the social network has gained more
significance every individual is curious to get more likes
to their posts so it is a very important task to stop the
fake accounts or detect the Sybil users in the network.
This paper does three tasks in total which are scalable
learning, sharing access rights and detection of fake

Keywords Social Networking, Scalable learning, Sybil


This paper concentrates mainly on the social
networking i.e. to know the usage of social network
account and to detect the fake users in the network. As
the Social networking sites are giving users free
access to create the account with that domain and
many users are taking advantage of this feature and
creating fake accounts for their self satisfaction. Apart
fromfake account detection we are also involved into
the work of knowing the user purpose of using a social
network account, and the system will be designed
where a user can share their views or images or videos
only with the specific group in social networks
Social Networking is a termwhich connects
many people globally with the help of internet. Social
networking has become a common thing for every
individual in todays world where we can see even a
child maintains an account in social network domains.
Social networking is possible in an organization,
schools, and colleges. Earlier there was social
networking but it was not that familiar as it was
concerned only to a specific organization and now it is
not only concerned with a specific organization its
involving everything schools, colleges, offices and
many other activities. A social networking service is
a platform to build social networks or social
relations among people who, for example, share
interests, activities, backgrounds, or real-life
connections. A social network service consists of a
representation of each user (often a profile), his/her
social links, and a variety of additional services. Most
social network services are web-based and provide
means for users to interact over the Internet, such as e-
mail and instant messaging. Online
community services are sometimes considered as a
social network service, though in a broader sense,
social network service usually means an individual-
centered service whereas online community services
are group-centered. Social networking sites allow
users to share ideas, pictures, posts, activities, events,
and interests with people in their network. The main
types of social networking services are those that
International Journal of Computer Trends and Technology (IJCTT) volume 4 Issue 9 Sep 2013
ISSN: 2231-2803 Page 3029

contain category places (such as former school year or
classmates), means to connect with friends (usually
with self-description pages), and a recommendation
systemlinked to trust.

Fig 1: Social Networking Network connecting people

The above figure drawn shows the way people are
connected in any social network sites. In Social
networks we can get connected to the people whom
we know and also can get connected with some new
people whom we dont even know before. Social
Network is basically used for connecting with people
and as told above its not only the known people it can
also be used to connect with unknown people and its
totally dependent on the user.


This paper gives an analysis on three different
tasks like to know the main purpose of the user using
the social networking site, giving an accessibility for
the user to share their data across the social network
secretly and detecting the fake accounts in the network
in order to save the domain space given to that
account. Social networking is very vast and a single
server cannot withstand all the users, so a new term
called Cloud computing comes into picture which is
allowing the social networking sites to increase the
users using these sites. Cloud Computing is a
technology which allows all other domains to store
their data in a common place termed as cloud, and for
which the security is provided by TPA (Third Party

Very famous application which almost many of
the users use is Facebook, a social network. This
application is used by many people across globe and
so the database required for this is very huge and a
single server cannot withstand this many users and
their data. The other thing that can be noticed here is
that a user of facebook can have any id for the login
i.e. Yahoo id or Gmail id or Rediff id is accepted as a
username, the point to be understood is that all the
servers of various companies are kept in a single room
like architecture called Cloud and because of which a
genuine user of any of these domains can easily access
even Facebook application.

Fig 2: Facebook Architecture

To know about the activity of a user in social network
we have proposed a model called as edge centric
model which is helpful for knowing the user activities
in the network with which the systemcan come to a
conclusion telling the main purpose the user has used
social network. This model is basically used to study
the edge corners of the user using that network; those
corners are called sparse social dimensions. A
thorough study is done on the user present in the
network i.e. the users connected to this node and the
way possible to connect to the other users in the
network. Every individual has got many groups in the
account like family, work, school and college. The
main concern of scalable learning is that we have to
know the purpose why user has used that network.
Earlier there was no such study that the reason was not
known why this network by used but in current day
systemit is important to know the purpose of using
the application.

Fig 3: A user with edges in anetwork

Suppose there is a user called 1 and has got many
other users who are connected to this user like
2,3,4,5,6 and 7. We need to know how the
user can interact with user 7 i.e. is 7 a direct friend
or friend of a friend. This all study is done in this
work with the edges of the existing users in the list.

Theorem 1: Suppose k social dimensions are extracted
froma network with m edges and n nodes. The density
International Journal of Computer Trends and Technology (IJCTT) volume 4 Issue 9 Sep 2013
ISSN: 2231-2803 Page 3030

(proportion of nonzero entries) of the social
dimensions based on edge partition is given as:
_ mIn (d

For many real-world networks whose node degree
follows a power law distribution, the upper bound in
Eq. (1) can be approximated as follows:


1 k
Where e>2 is the exponent of the power law

As told above edge centric algorithmis used to study
the users connected to the edges in a social network in
the same manner we can know the disjoint partitions
using the k-means clustering algorithm. The working
procedure for the same is mentioned below:

Algorithmfor K-means Variant:

Input: data instances x
|1im Number of clusters k
Output: {iJx

1.construct a mapping from features to instances
2. initialize the centroid of cluster {C
|1 j k}
3. repeat
4. reset {M axSim
}, {idx
5. for j=1:k
6. identify relevant instances Sj to centroid C

7. for i in Sj
8. compute sim(i, C
) of instance i and C

9. if sim(i, C
) >MaxSimi
10. MaxSim
=sim(i, C
11. idx
12. for i=1: m
13. update centroid C

14. until no change in idx or change of objective <

Thus we can know the user purpose of using that
social network with the help of above implementation
and thus giving a good study on the proposed work.
Coming with the next part which is the accessibility of
the views and images of the user among friends or
families or different groups. Here in this module the
application will take care that the data will be sent
only to those users whom the actual user wanted and
can customize the users into many such groups
depending upon the user request. This is again an
important task while updating our status or images
because most of the users feel that they want only
specific people to see their posts and it is achieved
with this part of implementation.

In the social network not only the user posts and
sharing of information but also the very important task
is efficiently using the social network. To give more
clear way of explanation we are considering an
example, say suppose a user has uploaded a image and
has got 10 friends in the list but his concern was like
wanted 25 likes to the image which is posted. In social
network the rule says only the friends can see the
content posted by user and no other people can view
that content. As this user has only 10 friends so the
maximumlikes that can turn up to this image is 10
and if needed more friends should increase in the list.
There are two ways for getting the friends i.e. genuine
way or creating the fake accounts just for getting more
likes. Those 15 which are just created will have only
one friend and that is the user who has created that
account and no other activity will be performed in that
account apart from likes. The process that will be
implemented here in this scenario is to detect such
type of accounts where there is no activity being
performed in the account apart fromlike, and if only
like is being done in a valid login session then it could
be a Sybil user. We are also considering other areas
like posts made by that user, likes done and sharing
messages among other users; so putting all these
conditions into scenario a account is decided whether
it is a fake account or a genuine account.


Social Network like application is developed
and the functionalities embedded into it are like
knowing the user activity i.e. the main purpose for
using that account. Also apart from the scalable
learning we have implemented a means through which
a user can go for sharing of personal data like images
or videos or messages in social network through a
secure manner where nobody else will know about the
processing being done. Every individual is monitored
particularly and the analysis is done to get the
complete details about the user activity in the social
network. The content of the user is tracked personally
by admin of the social network and only that admin
has got the right to take any action against that
account in near future. Apart fromthese we have also
proposed a means for detecting the Sybil users in the
social network and blocking their resources as the
Sybil user is just using that application for personal
satisfaction purpose and moreover no other activity is
being done fromthat account.


A. T. Fiore and J. S. Donath. Homophily in online
dating: when do you like someone like yourself? In
CHI 05: CHI 05 extended abstracts on Human
factors in computing systems, pages 13711374, 2005.

L. Getoor and B. Taskar, editors. Introduction to
Statistical Relational Learning. The MIT Press, 2007.
International Journal of Computer Trends and Technology (IJCTT) volume 4 Issue 9 Sep 2013
ISSN: 2231-2803 Page 3031

M. Hechter. Principles of Group Solidarity.
University of California Press, 1988.

R. Jin, A. Goswami, and G. Agrawal. Fast and exact
out-of-core and distributed k-means clustering.
Knowl. Inf. Syst., 10(1):1740, 2006.

T. Kanungo, D. M. Mount, N. S. Netanyahu, C. D.
Piatko, R. Silverman, and A. Y. Wu. An ecient k-
means clustering algorithm: Analysis and
implementation. IEEE Transactions on Pattern
Analysis and Machine Intelligence, 24:881892, 2002.

Y. Liu, R. Jin, and L. Yang. Semi-supervised multi-
label learning by constrained non-negative matrix
factorization. In AAAI, 2006.

S. A. Macskassy and F. Provost. A simple relational
classier. In Proceedings of the Multi-Relational Data
Mining Workshop (MRDM) at the Ninth ACM
SIGKDD International Conference on Knowledge
Discovery and Data Mining, 2003.

S. A. Macskassy and F. Provost. Classication in
networked data: A toolkit and a univariate case study.
J. Mach. Learn. Res., 8:935983, 2007.

M. McPherson, L. Smith-Lovin, and J. M. Cook.
Birds of a feather: Homophily in social networks.
Annual Review of Sociology, 27:415444, 2001.


Lavanya Sudula Pursuing
M.Tech(CSE) Vikas College of
Engineering and Technology ,
Nunna, Vijayawada. Affiliated to
JNTU-Kakinada, A.P., India

K. Chandra Sekhar Reddy, is
working as Associative professor
Vikas College of Engineering and
Technology, Nunna, Vijayawada,
Affiliated to JNTU-Kakinada, A.P.,

Prof S.V.Achutha Rao, is working
as an HOD of CSE at Vikas College
of Engineering and Technlogy,
Nunna, Vijayawada, Affiliated to
JNTU-Kakinada, A.P., India