この木なんの木　気になる木

AAAI
  • Sparse Multi-Task Learning for Detecting Influential Nodes in an Implicit Diffusion Network
COSN 2013
  • Hierarchical Community Decomposition Via Oblivious Routing Techniques
  • On the Performance of Percolation Graph Matching
EDBT 2013
  • Efficient Breadth-First Search on Large Graphs with Skewed Degree Distributions
  • CINEMA: Conformity-Aware Greedy Algorithm for Influence Maximization in Online Social Networks
ICDE 2011
  • Efficient Core Decomposition in Massive Networks
  • Mining Large Graphs: Algorithms, Inference, and Discoveries
  • Spectrum Based Fraud Detection in Social Networks
    • privacy
  • Decomposing DAGs into Spanning Trees: A New Way to Compress Transitive Closures
    • query proc.
  • Efficient Spectral Neighborhood Blocking for Entity Resolution
    • data mining
  • Consensus Spectral Clustering;
    • data mining
  • A New, Highly Efficient, and Easy To Implement Top-Down Join Enumeration Algorithm
    • best paper
ICDE 2012
  • An Efficient Graph Indexing Method
  • Extracting Analyzing and Visualizing Triangle K-Core Motifs within Networks
  • Community Detection with Edge Content in Social Media Networks
  • Efficient Graph Similarity Joins with Edit Distance Constraints
ICDE 2013
  • SociaLite: Datalog Extensions for Efficient Social Network Analysis
    • social
  • LinkProbe: Probabilistic Inference on Large-Scale Social Networks
    • social
  • Towards Efficient SimRank Computation on Large Graphs
  • Link Prediction across Networks by Biased Cross-Network Sampling
  • FERRARI: Flexible and Efficient Reachability Range Assignment for Graph Indexing
    • large graph
  • Top-k Graph Pattern Matching over Large Graphs
  • gIceberg: Towards Iceberg Analysis in Large Graphs
ICDE 2013
  • Efficient Search Algorithm for SimRank
ICDE 2014
  • A General Algorithm for Subtree Similarity-Search
  • Efficient Top-K Closeness Centrality Search
  • Contract & Expand: I/O Efficient SCCs computing
  • Efficient and Accurate Query Evaluation on Uncertain Graphs via Recursive Stratified Sampling
  • Subgraph Pattern Matching over Uncertain Graphs with Identity Linkage Uncertainty
  • Multi-Cost Optimal Route Planning under Time-Varying Uncertainty
  • Fast Incremental SimRank on Link-Evolving Graphs
ICDM 2012

Social Networks 1

  • Defining and Evaluating Network Communities based on Ground-truth
    • Leskovec
  • Community Preserving Lossy Compression of Social Networks
  • Spotting Culprits in Epidemics: How many and Which ones?
  • Detecting Anomalies in Bipartite Graphs with Mutual Dependency Principles
  • RankTopic: Ranking Based Topic Modeling
  • Automatically Discovering Talented Musicians with Acoustic Analysis of YouTube Videos

Privacy and Security

  • Reconstructing Graphs from Neighborhood Data
  • A General Framework for Publishing Privacy Protected and Utility Preserved Graph (Short)
  • Privacy-preserving SimRank over Distributed Information Network (Short)
  • Risks of Friendships on Social Networks (Short)

Clustering 2

  • Scalable and Memory-efficient Clustering of Large Scale Social Networks

Social Networks 2

  • Sequential Network Change Detection with Its Applications to Ad Impact Relation Analysis
  • Detecting Spam and Promoting Campaigns in the Twitter Social Network (Short)

Social Networks 3

  • Profit Maximization over Social Networks
  • Diffusion of Information in Social Networks: Is It All Local?
  • Clash of the Contagions: Cooperation and Competition in Information Diffusion
    • Leskovec
  • Link Prediction and Recommendation across Heterogenous Social Networks
  • Predicting Links in Multi-Relational and Heterogeneous Networks

Dynamics

  • Time Constrained Influence Maximization in Social Networks

Graphs and Networks

  • CT-IC: Continuously activated and Time-restricted Independent Cascade Model for Viral Marketing (Short)
  • Community-Affiliation Graph Model for Overlapping Network Community Detection (Short)
    • Leskovec
  • Mining User Mobility Features for Next Place Prediction in Location-based Services (Short)
  • Spatial Interpolation using Multiple Regression (Short)
ICDM 2013
  • http://icdm2013.rutgers.edu/schedule
  • CSI: Charged System Influence Model for Human Behavior Prediction
  • Linear Computation for Independent Social Influence
  • Massive Influence in Multiplex Social Networks: Model Representation and Analysis
  • UBLF: An Upper Bound Based Approach to Discover Influential Nodes in Social Networks
  • Influence and Profit: Two Sides of the Coin
  • Validating Network Value of Influencers by means of Explanations
  • Influence Maximization in Dynamic Social Networks

Social Network Analysis

  • Tree-like Structure in Social and Information Networks
  • An Efficient Approach to Updating Closeness Centrality and Average Path Length in Dynamic Networks

Graph and Network Mining

  • On Pattern Preserving Graph Generation
KDD 2005
  • Graphs over time: densification laws, shrinking diameters and possible explanations
KDD 2010
  • Community Outliers and their Efficient Detection in Information Networks
  • Fast Euclidean Minimum Spanning Tree: Algorithm, Analysis, Applications
  • Inferring Networks of Diffusion and Influence
KDD 2011
  • Sparsification of Influence Networks
  • Triangle Listing in Massive Networks and Its Applications
KDD 2012
  • A Structural Cluster Kernel for Learning on Graphs
  • Discovering Value from Community Activity on Focused Question-Answering Sites: A Case Study of Stack Overflow
  • Efficient Personalized PageRank with Accuracy Assurance
  • Fast Algorithms for Maximal Clique Enumeration with Limited Memory
  • Feature Grouping and Selection Over an Undirected Graph
KDD 2013
  • Efficient Single-Source Shortest Path and Distance Queries on Large Graphs
  • Clustered Graph Randomization: Network Exposure to Multiple Universes
  • Mining Frequent Graph Patterns with Differential Privacy
  • Maximizing Acceptance Probability for Active Friending in On-Line Social Networks
NIPS
  • Scalable influence estimation in continuous-time diffusion networks
PODS
    • Randomized Algorithms for Tracking Distributed Count, Frequencies, and Ranks
PODS 2008
SDM 2013
  • Triadic Measures on Graphs: The Power of Wedge Sampling
SEA 2011
  • A Hub-Based Labeling Algorithm for Shortest Paths on Road Networks
    • やはりそのうち読もう。
SIGMOD 2011
  • Local Graph Sparsification for Scalable Clustering
  • Fast Personalized PageRank on MapReduce
  • Neighborhood Based Fast Graph Search in Large Networks
  • Assessing and Ranking Structural Correlations in Graphs
  • A memory efficient reachability data structure through bit vector compression
  • Incremental Graph Pattern Matching
  • On k-skip shortest paths
  • Sampling Based Algorithms for Quantile Computation in Sensor Networks
SIGMOD 2012
  • Towards Effective Partition Management for Large Graphs
  • Efficient Processing of Distance Queries in Large Graphs: A Vertex Cover Approach
  • SCARAB: Scaling Reachability Computation on Large Graphs
  • A Highway-Centric Labeling Approach for Answering Distance Queries on Large Graphs
SIGMOD 2013
  • Shortest Path and Distance Queries on Road Networks: Towards Bridging Theory and Practice
    • 炎上
VLDB 2010
  • On Graph Query Optimization in Large Networks
    • r10_
VLDB 2011
  • On Triangulation-based Dense Neighborhood Graph Discovery
    • r8
  • Mining Top-K Large Structural Patterns in a Massive Network
    • r8
VLDB 2012
  • Dense Subgraph Maintenance under Streaming Edge Weight Updates for Real-time Story Identification
    • best paper
  • Truss Decomposition in Massive Networks
    • k-truss
VLDB 2013
  • Efficient SimRank-based Similarity Join Over Large Graphs
WSDM
    • Everyone's an Influencer Quantifying Influence on Twitter
WSDM 2013
  • On the Streaming Complexity of Computing Local. Clustering Coefficients
  • Cascade-based Community Detection
  • Influence Diffusion Dynamics and Influence Maximization in Social Networks with Friend and Foe Relationships
  • Overlapping community detection at scale: A Nonnegative Matrix Factorization Approach
    • Leskovec
WSDM 2014
  • FENNEL: Streaming Graph Partitioning for Massive Scale Graphs
  • Learning Social Network Embeddings for Predicting Information Diffusion
  • Active Learning for Networked Data Based on Non-progressive Diffusion Model
  • Fast Approximation of Betweenness Centrality Through Sampling
  • The Last Click: Why Users Give up Information Network Navigation
    • 例のごとくLeskovec
  • Scalable k-Means
    • タイトルがシンプルすぎる…
  • Effective Co-betweenness Centrality Computation
  • Finding HeavyPaths in Weighted Graphs and a Case-Study on Core Community Detection
WWW
  • Who says what to whom on twitter
  • Empirical Comparison of Algorithms for Network Community Detection
WWW 2000
  • Graph Structure in the Web
    • best paper
WWW 2012
  • Community Detection in Incomplete Information Networks
  • Distributed Graph Pattern Matching
  • Vertex Collocation Profiles: Subgraph Counting for Link Analysis and Prediction
WWW 2013
  • Predicting Positive and Negative Links in Signed Social Networks by Transfer Learning
  • Mining Structural Hole Spanners in Large Networks
  • What Is the Added Value of Negative Links in Online Social Networks?
WWW 2014
  • Random Walks based Modularity: Application to Semi-Supervised Learning by Robin Devooght, Amin Mantrach, Ilkka Kivimäki, Hugues Bersini, Alejandro Jaimes and Marco Saerens
  • High Quality, Scalable and Parallel Community Detection for Large Real Graph by Arnau Prat-Pérez, David Dominguez-Sal and Josep-Lluis Larriba-Pey
  • Dynamic and Historical Shortest-Path Distance Queries on Large Evolving Networks by Pruned Landmark Labeling by Takuya Akiba, Yoichi Iwata and Yuichi Yoshida
  • On Estimating the Average Degree by Anirban Dasgupta, Ravi Kumar and Tamas Sarlos
  • How information diffusion shapes social network structure by Seth Myers and Jue Leskovec
  • Can cascades be predicted? by Justin Cheng, Lada Adamic, Alex Dow, Jon Kleinberg and Jure Leskovec
  • How to Influence People with Partial Incentives by Erik Demaine, Mohammadtaghi Hajiaghayi, Hamid Mahini, David Malec, Anshul Sawant, Morteza Zadimoghaddam and S. Raghavan

?

  • Parameterized Approximability of Maximizing the Spread of Influence in Networks
KKKKKKKKKKKKKKKKKKKKKK
  • Towards Context-Aware Search by Learning A Very Large Variable Length Hidden Markov Model from Search Logs
    • WWW 2008
  • BBM: Bayesian Browsing Model from Petabyte-scale Data
  • Measuring Inter-Site Engagement
    • Y!
  • SIGIR 2007から
    • The Influence of Caption Features on Clickthrough Patterns in Web Search
    • Investigating the Querying and Browsing Behavior of Advanced Search Engine Users
    • Studying the Use of Popular Destinations to Enhance Web Search Interaction
Steiner Tree
  • Fast approximation of steiner trees in large graphs
  • STAR: Steiner-Tree Approximation in Relationship Graphs