Researchers develop algorithm to maximize friendship acceptance by strangers on social networks

Mar 06, 2013 by Bob Yirka report
The running example. Credit: arXiv:1302.7025

(Phys.org) —A small team of computer scientists from Taiwan, the U.S. and China has developed an algorithm that aids a desire to manipulate an unknown social network user into accepting a friend request. The idea, as they describe in their paper they've uploaded to the preprint server arXiv, is to offer intelligent suggestions of other people to friend to create a mutual social circle of friends, which will increase the odds of the ultimate target agreeing to a friend request.

Social network sites work based on the concept of one person sending a friend request to another. If the request is accepted, the two become "friends" which means they gain access to each other's privately posted information. Quite often, one person wishes to become "friends" with someone else on the network that they don't know—a celebrity perhaps, or a person of influence in business. Sending a friend request to such a person generally fails, however, because the person getting the request doesn't have any reason to accept. Celebrities rarely if ever accept friend requests from people they don't know, for example, if they did, their friend list would become unmanageable, not to mention useless—the idea behind a friend list is to keep in touch with friends, after all.

But still, sometimes it would be beneficial to somehow manipulate a into accepting a friend request by fooling them into believing that there are mutual acquaintances. Unfortunately, social networks don't offer a way to make that happen. In this new effort, the research team has devised a way to do it, by creating an that offers the names of people to friend to create an eventual to the intended target. As more and more of these friends accept friend requests, (because they appear to be in the same social circle), it becomes more and more likely that the actual intended target will accept a friend request as it appears to them that they and the requester have many common friends, and thus exist in the same social circle.

There is one caveat here, and that is the algorithm only works if implemented by the social network itself because they are the only ones that can analyze the structure of friend relationships between different individuals who don't know each other or have any friends in common. There is also the problem of figuring out why a social network such as Facebook would ever possibly want to add such a feature. It would seem contrary to their most basic philosophy—to allow "friends" to keep in touch.

Explore further: A numbers game: Math helps to predict how the body fights disease

More information: Maximizing Acceptance Probability for Active Friending in On-Line Social Networks, arXiv:1302.7025 [cs.SI] arxiv.org/abs/1302.7025

Abstract
Friending recommendation has successfully contributed to the explosive growth of on-line social networks. Most friending recommendation services today aim to support passive friending, where a user passively selects friending targets from the recommended candidates. In this paper, we advocate recommendation support for active friending, where a user actively specifies a friending target. To the best of our knowledge, a recommendation designed to provide guidance for a user to systematically approach his friending target, has not been explored in existing on-line social networking services. To maximize the probability that the friending target would accept an invitation from the user, we formulate a new optimization problem, namely, emph{Acceptance Probability Maximization (APM)}, and develop a polynomial time algorithm, called emph{Selective Invitation with Tree and In-Node Aggregation (SITINA)}, to find the optimal solution. We implement an active friending service with SITINA in Facebook to validate our idea. Our user study and experimental results manifest that SITINA outperforms manual selection and the baseline approach in solution quality efficiently.

via Arxiv Blog

Related Stories

How well do you know your friends?

Mar 25, 2011

How does your best friend feel when people act needy? Or, about people being dishonest? What do they think when others seem uncomfortable in social situations? According to an upcoming study in Psychological Science, a jour ...

Face it, even on the Web we want privacy

Jan 13, 2009

For most teenagers, privacy is important. They want to be able to go in their rooms, shut the door and close the world out. It's their safe place, a haven for them and their friends.

Good wingmen fib for a friend

Jan 17, 2012

It could be called the wingman theory or the Barney Stinson principle (after the character played by Neil Patrick Harris on hit TV show How I Met Your Mother). A University of Alberta researcher says that – like Barney ...

Half of your friends lost in seven years

May 28, 2009

Had a good chat with someone recently? Has a good friend just helped you to do up your home? Then you will be lucky if that person still does that in seven years time. Sociologist Gerald Mollenhorst investigated how the context ...

Recommended for you

Pop music heritage contributes to the formation of identity

18 hours ago

The musical rebels of the past are today's museum pieces. Pop music is increasingly penetrating heritage institutions such as museums and archives. That is apparent from the PhD research of Arno van der Hoeven. On Thursday ...

Helping older employees stay in their jobs

18 hours ago

Factors that can hinder older employees from continuing to work include workload, a poor memory and the pensionable age-effect. The Job-Exposure Matrix is a newly developed instrument that provides an easy way to chart the ...

Explainer: What is a small private online course?

20 hours ago

If you have studied an online course at a university over the past couple of decades, you've probably already experienced a SPOC, or Small Private Online Course. SPOC is a new term for an old concept, which appears to be frustrating members of the distance edu ...

User comments : 4

Adjust slider to filter visible comments by rank

Display comments: newest first

icuvd
3.7 / 5 (9) Mar 06, 2013
A small team of lonely computer scientists from Taiwan, the U.S. and China has developed an algorithm that aids them in acquiring otherwise unobtainable facebook babe friends.
cmn
3 / 5 (4) Mar 06, 2013
Oh, FB has been working on this for awhile. It's called: Pedo-friend Finder.
rwinners
4 / 5 (4) Mar 06, 2013
Ah, a bit of scientifically supported thought on how humans manipulate each other.
Huns
2.6 / 5 (5) Mar 06, 2013
But still, sometimes it would be beneficial to somehow manipulate a stranger into accepting a friend request by fooling them into believing that there are mutual acquaintances. Unfortunately, social networks don't offer a way to make that happen.

I see nothing unfortunate about it, unless you have some kind of empathy disorder.

Please sign in to add a comment. Registration is free, and takes less than a minute. Read more

Click here to reset your password.
Sign in to get notified via email when new comments are made.