Design of a Data Model for Social Networks Applications

2009 ◽  
pp. 360-385
Author(s):  
Susanta Mitra ◽  
Aditya Bagchi ◽  
A. K. Bandyopadhyay
Keyword(s):  
Social Networks ◽  
Social Network ◽  
Data Model ◽  
Generic Model ◽  
Social Community ◽  
Graph Data ◽  
Related Data ◽  
Network Applications ◽  
Object Relational ◽  
The Common

A social network defines the structure of a social community like an organization or institution, covering its members and their inter-relationships. Social relationships among the members of a community can be of different types like friendship, kinship, professional, academic etc. Traditionally, a social network is represented by a directed graph. Analysis of graph structure representing a social network is done by the sociologists to study a community. Hardly any effort has been made to design a data model to store and retrieve a social network related data. In this paper, an object-relational graph data model has been proposed for modeling a social network. The objective is to illustrate the power of this generic model to represent the common structural and node-based properties of different social network applications. A novel multi-paradigm architecture has been proposed to efficiently manage the system. New structural operators have been defined in the paper and the application of these operators has been illustrated through query examples. The completeness and the minimality of the operators have also been shown.

Design of a Data Model for Social Network Applications

2008 ◽  
pp. 2338-2363
Author(s):  
Susanta Mitra ◽  
Aditya Bagchi ◽  
A. K. Bandyopadhyay
Keyword(s):  
Social Network ◽  
Directed Graph ◽  
Data Model ◽  
Generic Model ◽  
Social Community ◽  
Graph Data ◽  
Related Data ◽  
Network Applications ◽  
Object Relational ◽  
The Common

A social network defines the structure of a social community like an organization or institution, covering its members and their inter-relationships. Social relationships among the members of a community can be of different types like friendship, kinship, professional, academic, and so forth. Traditionally, a social network is represented by a directed graph. Analysis of graph structure representing a social network is done by the sociologists to study a community. Hardly any effort has been made to design a data model to store and retrieve social-network-related data. In this paper, an object-relational graph data model has been proposed for modeling a social network. The objective is to illustrate the power of this generic model to represent the common structural and node-based properties of different social network applications. A novel, multi-paradigm architecture has been proposed to efficiently manage the system. New structural operators have been defined in the paper and the application of these operators has been illustrated through query examples. The completeness and the minimality of the operators have also been shown.

Design of a Data Model for Social Network Applications

2009 ◽  
pp. 414-439
Author(s):  
Susanta Mitra ◽  
Aditya Bagchi ◽  
A.K. Bandyopadhyay
Keyword(s):  
Social Network ◽  
Directed Graph ◽  
Data Model ◽  
Generic Model ◽  
Social Community ◽  
Graph Data ◽  
Related Data ◽  
Network Applications ◽  
Object Relational ◽  
The Common

A social network defines the structure of a social community like an organization or institution, covering its members and their inter-relationships. Social relationships among the members of a community can be of different types like friendship, kinship, professional, academic, and so forth. Traditionally, a social network is represented by a directed graph. Analysis of graph structure representing a social network is done by the sociologists to study a community. Hardly any effort has been made to design a data model to store and retrieve social-network-related data. In this paper, an object-relational graph data model has been proposed for modeling a social network. The objective is to illustrate the power of this generic model to represent the common structural and node-based properties of different social network applications. A novel, multi-paradigm architecture has been proposed to efficiently manage the system. New structural operators have been defined in the paper and the application of these operators has been illustrated through query examples. The completeness and the minimality of the operators have also been shown.

MapTap and Cornelia Slow Digital Art History and Formal Art Historical Social Network Research

2016 ◽  
Vol 79 (3) ◽  
pp. 315-330 ◽  
Author(s):  
Koenraad Brosens ◽  
Klara Alen ◽  
Astrid Slegten ◽  
Fred Truyen
Keyword(s):  
Social Networks ◽  
Social Network ◽  
Early Modern ◽  
Data Model ◽  
Art History ◽  
Digital Art ◽  
Unique Data ◽  
Network Research ◽  
Custom Made

Abstract The essay introduces MapTap, a research project that zooms in on the ever-changing social networks underpinning Flemish tapestry (1620 – 1720). MapTap develops the young and still slightly amorphous field of Formal Art Historical Social Network Research (FAHSNR) and is fueled by Cornelia, a custom-made database. Cornelia’s unique data model allows researchers to organize attribution and relational data from a wide array of sources in such a way that the complex multiplex and multimode networks emerging from the data can be transformed into partial unimode networks that enable proper FAHSNR. A case study revealing the key roles played by women in the tapestry landscape shows how this kind of slow digital art history can further our understanding of early modern creative communities and industries.

scholarly journals Differentially Private Recommendation System Based on Community Detection in Social Network Applications

2018 ◽  
Vol 2018 ◽  
pp. 1-18 ◽  
Author(s):  
Gesu Li ◽  
Zhipeng Cai ◽  
Guisheng Yin ◽  
Zaobo He ◽  
Madhuri Siddula
Keyword(s):  
Social Networks ◽  
Social Network ◽  
Community Detection ◽  
Recommendation System ◽  
Detection Method ◽  
Personal Information ◽  
The Internet ◽  
Sensitive Information ◽  
Network Applications ◽  
Target Attributes

The recommender system is mainly used in the e-commerce platform. With the development of the Internet, social networks and e-commerce networks have broken each other’s boundaries. Users also post information about their favorite movies or books on social networks. With the enhancement of people’s privacy awareness, the personal information of many users released publicly is limited. In the absence of items rating and knowing some user information, we propose a novel recommendation method. This method provides a list of recommendations for target attributes based on community detection and known user attributes and links. Considering the recommendation list and published user information that may be exploited by the attacker to infer other sensitive information of users and threaten users’ privacy, we propose the CDAI (Infer Attributes based on Community Detection) method, which finds a balance between utility and privacy and provides users with safer recommendations.

Design of a Data Model for Social Network Applications

2007 ◽  
Vol 18 (4) ◽  
pp. 51-79 ◽  
Author(s):  
Susanta Mitra ◽  
Aditya Bagchi ◽  
A.K. Bandyopadhyay
Keyword(s):  
Social Network ◽  
Data Model ◽  
Network Applications

scholarly journals Structural Attack to Anonymous Graph of Social Networks

2013 ◽  
Vol 2013 ◽  
pp. 1-8 ◽  
Author(s):  
Tieying Zhu ◽  
Shanshan Wang ◽  
Xiangtao Li ◽  
Zhiguo Zhou ◽  
Riming Zhang
Keyword(s):  
Social Networks ◽  
Social Network ◽  
Graph Matching ◽  
Rapid Development ◽  
Sensitive Information ◽  
Matching Method ◽  
Graph Data ◽  
Social Network Data ◽  
Regional Feature ◽  
Social Graphs

With the rapid development of social networks and its applications, the demand of publishing and sharing social network data for the purpose of commercial or research is increasing. However, the disclosure risks of sensitive information of social network users are also arising. The paper proposes an effective structural attack to deanonymize social graph data. The attack uses the cumulative degree ofn-hop neighbors of a node as the regional feature and combines it with the simulated annealing-based graph matching method to explore the nodes reidentification in anonymous social graphs. The simulation results on two social network datasets show that the attack is feasible in the nodes reidentification in anonymous graphs including the simply anonymous graph, randomized graph andk-isomorphism graph.

scholarly journals A Novel Graph-modification Technique for User Privacy-preserving on Social Networks

2019 ◽  
Vol 3 ◽  
pp. 27-38 ◽  
Author(s):  
Seyedeh Hamideh Erfani ◽  
Reza Mortazavi
Keyword(s):  
Social Networks ◽  
Social Network ◽  
Challenging Problem ◽  
User Privacy ◽  
Network Graph ◽  
Related Data ◽  
Minimum Number ◽  
Modification Technique ◽  
Utility Metrics ◽  
Edge Addition

The growing popularity of social networks and the increasing need for publishing related data mean that protection of privacy becomes an important and challenging problem in social networks. This paper describes the (k,l k,l k,l)-anonymity model used for social network graph anonymization. The method is based on edge addition and is utility-aware, i.e. it is designed to generate a graph that is similar to the original one. Different strategies are evaluated to this end and the results are compared based on common utility metrics. The outputs confirm that the na¨ıve idea of adding some random or even minimum number of possible edges does not always produce useful anonymized social network graphs, thus creating some interesting alternatives for graph anonymization techniques.

scholarly journals A Psychoanalysis of Data Privacy Maintenance Issues in Social Network using Data mining

2019 ◽  
Vol 9 (1) ◽  
pp. 7018-7022
Keyword(s):  
Data Mining ◽  
Social Networks ◽  
Social Network ◽  
Elliptic Curve Cryptography ◽  
Data Privacy ◽  
On Line ◽  
The Common ◽  
Using Data ◽  
Present Subject ◽  
Existing Data

The existing data sharing systems relates with the on-line social networks (OSNs) suggest encoding of information before sharing, the multiparty get to the executives of scrambled information has turned into a troublesome issue. A safe information sharing subject proposed in OSNs upheld figure content approach trait based and Elliptic Curve Cryptography algorithmic principle re-encryption and mystery sharing. The work relates the gatekeeper clients' delicate information grants clients to redo get to approaches of their information thus source scrambled information to the OSNs administration provider. The proposed technique displays a multiparty get to the executive’s model that enables the communicator to refresh the entrance strategy of figure content. The characteristics fulfill the common access strategy. The work needs a fractional mystery composing development inside which the calculation overhead of client is essentially diminished by strengthening the vast majority of the mystery composing activities to the OSNs administration provider. Moreover, the check capacity on the outcomes originated from the OSNs administration provider to guarantee the rightness of fractional decoded figure content. The present subject partner affordable properties disavowal philosophy that accomplishes each forward and in reverse mystery. The insurance and execution examination results demonstrate that the arranged subject is secure and efficient in OSNs.

scholarly journals School Libraries and Social Networks

2021 ◽  
Author(s):  
Gina Roncaglia
Keyword(s):  
Social Networks ◽  
Social Network ◽  
Web 2.0 ◽  
Special Interest ◽  
School Libraries ◽  
University Libraries ◽  
Content Sharing ◽  
Network Applications ◽  
Social Reading

After a brief introduction to social networks, considered as one of the key tools of web 2.0, the paper deals with the possible uses of social networks and social network applications by school libraries. Social networks are widely used by students, and the range of tools available (or to be implemented) within social‐networks is steadily growing. Among them, of special interest for school libraries are 'social reading' and content sharing applications. The paper advocates an active use of social network tools and applications by school libraries, and contrasts such an active use with the simple ‘placeholder’ pages usually implemented both by school and by university libraries. Web 2.0, social networks, social reading, school libraries

Enhancing User Engagement with Elected Officials

2014 ◽  
Vol 5 (3) ◽  
pp. 1-21
Author(s):  
Marc Fudge
Keyword(s):  
Social Networks ◽  
Social Network ◽  
Web Sites ◽  
Local Governments ◽  
Elected Officials ◽  
User Engagement ◽  
The Public ◽  
Network Applications ◽  
Government Web Sites ◽  
The Government

Keenly aware of the growing number of people using social networks to communicate, governments have begun to provide this popular form of communication on their own web sites in an effort to promote engagement among residents and public administrators. Yet despite the growing popularity of social networks on government web sites, it is unclear whether municipalities have begun providing links to social network sites on their homepage that allow users to discuss salient issues directly with elected officials. Furthermore, for cities that do offer this heightened level of engagement, it is unclear if an implementation strategy was followed. This exploratory study examines the factors impacting U.S. local governments to provide social network applications that allow users to communicate directly with elected officials on the government website. The study then explores the benefits and challenges elected officials face when determining the extent of their public communication efforts. Finally, a social network application strategy is developed to assist elected officials when deciding whether or not to use social networks to communicate with the public.

Sign in / Sign up

Export Citation Format

Share Document