Finding low-tension communities

@article{Galbrun2017FindingLC,
  title={Finding low-tension communities},
  author={Esther Galbrun and Behzad Golshan and A. Gionis and Evimaria Terzi},
  journal={ArXiv},
  year={2017},
  volume={abs/1701.05352}
}
Motivated by applications that arise in online social media and collaboration networks, there has been a lot of work on community-search. In this class of problems, the goal is to find a subgraph that satisfies a certain connectivity requirement and contains a given collection of seed nodes. In this paper, we extend the community-search problem by associating each individual with a profile. The profile is a numeric score that quantifies the position of an individual with respect to a topic… 

Figures and Tables from this paper

Team Formation for Scheduling Educational Material in Massive Online Classes

The goal is to teach students within time frame d such that their potential for learning is maximized and find the best schedule for each group and a polynomial algorithm is developed for this problem.

Maximizing the Diversity of Exposure in a Social Network

This paper proposes a novel approach to maximize the diversity of exposure in a social network by introducing a novel extension to the notion of random reverse-reachable sets and demonstrates the efficiency and scalability of the algorithm on several real-world datasets.

References

SHOWING 1-10 OF 25 REFERENCES

Finding a team of experts in social networks

This work is the first work to consider the TEAM FORMATION problem in the presence of a social network of individuals and measures effectiveness using the communication cost incurred by the subgraph in G that only involves X'.

In search of influential event organizers in online social networks

This paper takes the first systematic step to discover influential event organizers from online social networks who are essential to the overall success of social events by proposing three algorithms to find approximate solutions to the problem.

Opinion Maximization in Social Networks

This paper adopts a well-established model for social-opinion dynamics and formalizes the campaign-design problem as the problem of identifying a set of target individuals whose positive opinion about an information item will maximize the overall positive opinion for the item in the social network.

Multi-skill Collaborative Teams based on Densest Subgraphs

This work presents a 3-approximation algorithm that improves upon a naive extension of the previously known algorithm for densest at least $k$ subgraph problem and shows how the same approximation can be extended to a special case of multiple skills.

Center-piece subgraphs: problem definition and fast solutions

Wall-clock timing results on the DBLP dataset show that the proposed approximation achieve good accuracy for about 6:1 speedup, and experiments confirm that the method naturally deals with multi-source queries and that the resulting subgraphs agree with the intuition.

Towards realistic team formation in social networks based on densest subgraphs

Experiments show that the proposed formulation (GDSP) is useful in modeling a broader range of team formation problems and that the method, FORTE, produces more coherent and compact teams of high quality.

Team Formation for Generalized Tasks in Expertise Social Networks

  • Cheng-te LiM. Shan
  • Computer Science
    2010 IEEE Second International Conference on Social Computing
  • 2010
This work extends the Enhanced-Steiner algorithm to a generalized version for generalized tasks, and presents a novel grouping-based method that condenses the expertise information to a group graph according to required skills.

Online team formation in social networks

This paper proposes efficient algorithms that address all requirements of online team formation: these algorithms form teams that always satisfy the required skills, provide approximation guarantees with respect to team communication overhead, and they are online-competitive with Respect to load balancing.

Discovering top-k teams of experts with/without a leader in social networks

Two procedures that produce top-k teams of experts with or without a leader in polynomial delay are proposed and the effectiveness and scalability of the proposed methods are demonstrated.

How Bad is Forming Your Own Opinion?