Arboricity and subgraph listing algorithms
SIAM Journal on Computing
Combining fuzzy information from multiple systems
Journal of Computer and System Sciences
Optimal aggregation algorithms for middleware
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Novelty and redundancy detection in adaptive filtering
SIGIR '02 Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval
Minimal probing: supporting expensive predicates for top-k queries
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Group formation in large social networks: membership, growth, and evolution
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Spark: top-k keyword query in relational databases
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
A survey of top-k query processing techniques in relational database systems
ACM Computing Surveys (CSUR)
Main-memory triangle computations for very large (sparse (power-law)) graphs
Theoretical Computer Science
Proceedings of the Second ACM International Conference on Web Search and Data Mining
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Introduction to Algorithms, Third Edition
Introduction to Algorithms, Third Edition
What is Twitter, a social network or a news media?
Proceedings of the 19th international conference on World wide web
A unified framework for recommending diverse and relevant queries
Proceedings of the 20th international conference on World wide web
Proceedings of the 20th international conference on World wide web
Efficient diversity-aware search
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Efficient core decomposition in massive networks
ICDE '11 Proceedings of the 2011 IEEE 27th International Conference on Data Engineering
Triangle listing in massive networks and its applications
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Scalable Diversified Ranking on Large Graphs
ICDM '11 Proceedings of the 2011 IEEE 11th International Conference on Data Mining
Finding, counting and listing all triangles in large graphs, an experimental study
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Truss decomposition in massive networks
Proceedings of the VLDB Endowment
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
Social contagion depicts a process of information (e.g., fads, opinions, news) diffusion in the online social networks. A recent study reports that in a social contagion process the probability of contagion is tightly controlled by the number of connected components in an individual's neighborhood. Such a number is termed structural diversity of an individual and it is shown to be a key predictor in the social contagion process. Based on this, a fundamental issue in a social network is to find top-k users with the highest structural diversities. In this paper, we, for the first time, study the top-k structural diversity search problem in a large network. Specifically, we develop an effective upper bound of structural diversity for pruning the search space. The upper bound can be incrementally refined in the search process. Based on such upper bound, we propose an efficient framework for top-k structural diversity search. To further speed up the structural diversity evaluation in the search process, several carefully devised heuristic search strategies are proposed. Extensive experimental studies are conducted in 13 real-world large networks, and the results demonstrate the efficiency and effectiveness of the proposed methods.