• No results found

Social graphs

The risk of node re-identification in labeled social graphs

The risk of node re-identification in labeled social graphs

... computer-mediated social interactions are recorded nowadays by individual researchers or by ...real social graphs and the supply of such datasets are well established, the flow of data from data ...

20

Publishing attributed social graphs with formal privacy guarantees

Publishing attributed social graphs with formal privacy guarantees

... which results in at least one new triangle. With probability 1 − ρ , the endpoint v j is sampled from π instead. After each new edge addition, the oldest edge in the graph is deleted to ensure that the expected degree ...

17

Thesis

Thesis

... Huang implemented a recommendation system on Facebook that mines users’ social graphs and ran Bacon and Dewan’s algorithm to generate Friend-list predictions. She also created a Facebook app that asks users ...

34

Recommending Friend In Social Networks Based On Semantic

Recommending Friend In Social Networks Based On Semantic

... services. Social networking sites imply friend recommendation Systems in contribution to providing better user ...Current social networking servicing recommend friends to users based on their social ...

6

Privacy Preservation Analysis in Social Network Graphs for avoiding Community Detection and Publishing Sensitive Information

Privacy Preservation Analysis in Social Network Graphs for avoiding Community Detection and Publishing Sensitive Information

... Many social-web offer free services in exchange for a large source of user information and some services on the social web are paid and users demand privacy for their paid content for not leaking to an ...

6

Collaborative Topic Regression with Multiple Graphs Factorization for Recommendation in Social Media

Collaborative Topic Regression with Multiple Graphs Factorization for Recommendation in Social Media

... multiple social graphs ...latent social structure for all views but with different user ...multiple graphs factorization process in the proposed model can be seen as a regularization approach ...

12

Friend book: A Scalable and Efficient Friend Recommendation Using Integrated Feedback Approach

Friend book: A Scalable and Efficient Friend Recommendation Using Integrated Feedback Approach

... Friend book is a novel semantic-based friend recommendation system for social networks, based on their life styles instead of social graphs which recommends friends to users. Friend book discovers ...

5

An Efficient Method For Friend Recommendation On Social Networks

An Efficient Method For Friend Recommendation On Social Networks

... for social networks, which suggests friends to users based on their life styles instead of social ...friends. Social networking services (SNSs) provide a platform where likeminded people interact and ...

5

This article presents an overview of these four applications. 2. DOCOMO Phone Book

This article presents an overview of these four applications. 2. DOCOMO Phone Book

... The social server can also draw a social graphs *5 by calculating relationships between the users of the cloud phone book synchronization function based on the contact data and My Profile data they ...

9

A Modern Approach of Discovering Friends in Social Networks Based on Friend Matching Graph

A Modern Approach of Discovering Friends in Social Networks Based on Friend Matching Graph

... on social graphs in existing social networking services, Friend-matching book extracted life styles from user-centric data collected from sensors on the smart phone and recommended probable friends ...

5

A Survey on Semantic-based Friend Recommendation System for Social Networks

A Survey on Semantic-based Friend Recommendation System for Social Networks

... Existing social networking services recommend friends to users based on their social graphs, which may not be the most appropriate to reflect a user’s preferences on friend selection in real ...for ...

8

Some Forbidden Subgraphs of Trees Being Opposition Graphs

Some Forbidden Subgraphs of Trees Being Opposition Graphs

... Now we put our attention on the necessary and sufficient conditions of trees being opposition graphs. A graph G is called an opposition graph if there exists an orientation such that every induced P 4: abcd, a →b ...

6

The matching energy of graphs with given edge connectivity

The matching energy of graphs with given edge connectivity

... extremal graphs with respect to matching energy among some classes of connected graphs with n ...extremal graphs in connected unicyclic, bicyclic graphs were determined in [] and [, ], ...

9

Social Network Analysis by Using Graphs to Represent Social Relations
Vandana Janjirala & SK Abdul Nabi

Social Network Analysis by Using Graphs to Represent Social Relations Vandana Janjirala & SK Abdul Nabi

... publish social information on the ...Extracting social net- work from noisy, real world data is a challenging task, even if the information is already encoded in RDF using well defined ...various ...

7

SNAP BATNET: Cascading Author Profiling and Social Network Graphs for Suicide Ideation Detection on Social Media

SNAP BATNET: Cascading Author Profiling and Social Network Graphs for Suicide Ideation Detection on Social Media

... of social stigma related to it which prevents people from disclosing their thoughts and seeking professional ...of social media networks to share information about their mental health online (Park et ...on ...

10

A Comparison on Metric Dimension of Graphs, Line Graphs, and Line Graphs of the Subdivision Graphs

A Comparison on Metric Dimension of Graphs, Line Graphs, and Line Graphs of the Subdivision Graphs

... para-line graphs; we also compare metric dimension of graphs, line graphs, and para-line ...para-line graphs for some classes of graphs; further, we give an example of a graph G such ...

15

Random Walks on Context Aware Relation Graphs for Ranking Social Tags

Random Walks on Context Aware Relation Graphs for Ranking Social Tags

... Many social tagging methods are based on independence assumption, which is widely adopted in computational linguistics (Manning and Schutze, 2000) and information re- trieval (Manning et ...

10

Super Edge-antimagic Graceful labeling of Graphs

Super Edge-antimagic Graceful labeling of Graphs

... We consider finite undirected nontrivial graphs without loops and multiple edges. We denote by V (G) and E(G) the set of vertices and the set of edges of a graph G, respectively. Let |V (G)| = p and |E(G)| = q be ...

6

On the F-index and F-coindex of the line graphs of the subdivision graphs

On the F-index and F-coindex of the line graphs of the subdivision graphs

... studied some more topological indices of the line graphs of the subdivision graphs of the above mentioned nanostructures. Gao et al. [8] have studied certain topological indices, such as Randi´c index, ABC ...

7

Benefiting From the Community Structure in Opportunistic Forwarding

Benefiting From the Community Structure in Opportunistic Forwarding

... have shown that node mobility in DTNs is not entirely random, and instead, some patterns can be found more or less. Based on this observation, some researchers proposed utility-based routing protocols[7][33][34], in ...

12

Show all 10000 documents...

Related subjects