369,923 research outputs found
Distributed Private Online Learning for Social Big Data Computing over Data Center Networks
With the rapid growth of Internet technologies, cloud computing and social
networks have become ubiquitous. An increasing number of people participate in
social networks and massive online social data are obtained. In order to
exploit knowledge from copious amounts of data obtained and predict social
behavior of users, we urge to realize data mining in social networks. Almost
all online websites use cloud services to effectively process the large scale
of social data, which are gathered from distributed data centers. These data
are so large-scale, high-dimension and widely distributed that we propose a
distributed sparse online algorithm to handle them. Additionally,
privacy-protection is an important point in social networks. We should not
compromise the privacy of individuals in networks, while these social data are
being learned for data mining. Thus we also consider the privacy problem in
this article. Our simulations shows that the appropriate sparsity of data would
enhance the performance of our algorithm and the privacy-preserving method does
not significantly hurt the performance of the proposed algorithm.Comment: ICC201
An integrated ranking algorithm for efficient information computing in social networks
Social networks have ensured the expanding disproportion between the face of
WWW stored traditionally in search engine repositories and the actual ever
changing face of Web. Exponential growth of web users and the ease with which
they can upload contents on web highlights the need of content controls on
material published on the web. As definition of search is changing,
socially-enhanced interactive search methodologies are the need of the hour.
Ranking is pivotal for efficient web search as the search performance mainly
depends upon the ranking results. In this paper new integrated ranking model
based on fused rank of web object based on popularity factor earned over only
valid interlinks from multiple social forums is proposed. This model identifies
relationships between web objects in separate social networks based on the
object inheritance graph. Experimental study indicates the effectiveness of
proposed Fusion based ranking algorithm in terms of better search results.Comment: 14 pages, International Journal on Web Service Computing (IJWSC),
Vol.3, No.1, March 201
Tunable and Growing Network Generation Model with Community Structures
Recent years have seen a growing interest in the modeling and simulation of
social networks to understand several social phenomena. Two important classes
of networks, small world and scale free networks have gained a lot of research
interest. Another important characteristic of social networks is the presence
of community structures. Many social processes such as information diffusion
and disease epidemics depend on the presence of community structures making it
an important property for network generation models to be incorporated. In this
paper, we present a tunable and growing network generation model with small
world and scale free properties as well as the presence of community
structures. The major contribution of this model is that the communities thus
created satisfy three important structural properties: connectivity within each
community follows power-law, communities have high clustering coefficient and
hierarchical community structures are present in the networks generated using
the proposed model. Furthermore, the model is highly robust and capable of
producing networks with a number of different topological characteristics
varying clustering coefficient and inter-cluster edges. Our simulation results
show that the model produces small world and scale free networks along with the
presence of communities depicting real world societies and social networks.Comment: Social Computing and Its Applications, SCA 13, Karlsruhe : Germany
(2013
How to Calculate the Public Psychological Pressure in the Social Networks
With the worldwide application of social networks, new mathematical approaches have been developed that quantitatively address this online trend, including the concept of social computing. The analysis of data generated by social networks has become a new field of research; social conflicts on social networks occur frequently on the internet, and data regarding social behavior on social networks must be analyzed objectively. This type of social computing method can solve a series of complex social computing problems including the calculation of public psychological pressure. The quantitative calculation of public psychological pressure is so important to the public opinion analysis that it can be widely applied in a lot of public information analysis fields
Security and Privacy Issues of Big Data
This chapter revises the most important aspects in how computing
infrastructures should be configured and intelligently managed to fulfill the
most notably security aspects required by Big Data applications. One of them is
privacy. It is a pertinent aspect to be addressed because users share more and
more personal data and content through their devices and computers to social
networks and public clouds. So, a secure framework to social networks is a very
hot topic research. This last topic is addressed in one of the two sections of
the current chapter with case studies. In addition, the traditional mechanisms
to support security such as firewalls and demilitarized zones are not suitable
to be applied in computing systems to support Big Data. SDN is an emergent
management solution that could become a convenient mechanism to implement
security in Big Data systems, as we show through a second case study at the end
of the chapter. This also discusses current relevant work and identifies open
issues.Comment: In book Handbook of Research on Trends and Future Directions in Big
Data and Web Intelligence, IGI Global, 201
- …