ICDM 2011 Accepted Papers on Social Networks Related Topics

October 30, 2011 Leave a comment

Here is the list of accepted papers in ICDM 2011. The following accepted papers of ICDM 2011 are related to social networks:

  • Beyond `Caveman Communities’: Hubs and Spokes for Graph Compression and Mining
    U Kang and Christos Faloutsos

  • Inferring the Diffusion and Evolution of Topics in Social Communities
    Xide Lin, Qiaozhu Mei, Jiawei Han, Yunliang Jiang, and Marina Danilevsky

  • Detecting Community Kernels in Large Social Networks
    Liaoruo Wang, Tiancheng Lou, Jie Tang, and John Hopcroft

  • Privacy Risk In Graph Stream Publishing For Social Network Applications
    Nigel Medforth and Ke Wang

  • LinkBoost: A Novel Cost-Sensitive Boosting Framework for Community-Level Network Link Prediction
    Prakash Mandayam Comar, Pang-Ning Tan, and Anil Jain

  • D-cores: measuring cohesion and collaboration of directed graphs
    Christos Giatsidis, Michalis Vazirgiannis, and Dimitrios Thilikos

  • SIMPATH: An Efficient Algorithm for Influence Maximization under the Linear Threshold Model
    Amit Goyal, Wei Lu, and Laks Lakshmanan

  • Threshold Conditions for Arbitrary Cascade Models on Arbitrary Networks
    B. Aditya Prakash, Deepayan Chakrabarti, Michalis Faloutsos, Nicholas Valler, and Christos Faloutsos

  • Isograph: Neighbourhood Graph Construction Based On Geodesic Distance For Semi-Supervised Learning
    Marjan Ghazvininejad, Mostafa Mahdieh, Hamid R. Rabiee, Parisa Khanipour Roshan, and Mohammad Hossein Rohban

  • Minimizing Seed Set for Viral Marketing
    Long Cheng and Raymond Chi-Wing WONG

  • Mining Heavy Subgraphs in Time-Evolving Networks
    Petko Bogdanov, Misael Mongiovi, and Ambuj K. Singh

  • TWITOBI: A Recommendation System for Twitter using Probabilistic Modeling
    Younghoon Kim and Kyuseok Shim

  • (Short Paper) On the Hardness of Graph Anonymization
    Charu Aggarwal, Yao Li, and Philip S. Yu

  • (Short Paper) Entropy-Based Graph Mining: Application to Biological and Social Networks
    Young-Rae Cho and Edward Casey Kenley

  • (Short Paper) Identities Anonymization in Dynamic Social Networks
    Chih-Hua Tai Tai, Peng-Jui Tseng, Philip S. Yu, and Ming-Syan Chen

  • (Short Paper) Cross-temporal Link Prediction
    Satoshi Oyama, Kohei Hayashi, and Hisashi Kashima

  • (Short Paper) Discovering Emerging Topics in Social Streams via Link Anomaly Detection
    Toshimitsu Takahashi, Ryota Tomioka, and Kenji Yamanishi

  • (Short Paper) Finding Communities in Dynamic Social Networks
    Chayant Tantipathananandh and Tanya Berger-Wolf


CIKM 2011 Accepted Papers on Social Networks

October 22, 2011 Leave a comment

CIKM 2011 accepted papers list is available here. The following papers are especially related to social networks:

  • Discovering Top-k Teams of Experts with/without a Leader in Social Networks
    Mehdi Kargar (York University), Aijun An (York University)

  • Evolving Social Search Based on Bookmarks and Status Messages from Social Networks
    Bastian Karweg (Mobile Advertising GmbH), Christian Huetter (Karlsruhe Institute of Technology), Klemens Boehm (Karlsruhe Institute of Technology)

  • Large-Scale Behavioral Targeting with a Social Twist
    Kun Liu (Yahoo! Labs), Lei Tang (Yahoo! Labs)

  • Using Query Log and Social Tagging to Refine Queries Based on Latent Topics
    Lidong Bing (The Chinese University of Hong Kong), Wai Lam (The Chinese University of Hong Kong), Tak-Lam Wong (The Hong Kong Institute of Education)

  • Workload-Aware Indexing for Keyword Search in Social Networks
    Truls A. Bjørklund (Norwegian University of Science and Technology),
    Michaela Götz (Cornell University),
    Johannes Gehrke (Cornell University),
    Nils Grimsmo (Norwegian University of Science and Technology)

  • CASINO: Towards Conformity-aware Social Influence Analysis in Online Social Networks (Short Paper)
    Hui Li (Nanyang Technological University),
    Sourav S Bhowmick (Nanyang Technological University),
    Aixin Sun (Nanyang Technological University)

  • Content based Social Behavior Prediction: A Multi-task Learning Approach (Short Paper)
    Hongliang Fei (University of Kansas),
    Ruoyi Jiang (University of Kansas),
    Yuhao Yang (University of Kansas),
    Bo Luo (University of Kansas),
    Jun Huan (University of Kansas)

  • Content-Driven Detection of Campaigns in Social Media (Short Paper)
    Kyumin Lee (Texas A&M University),
    James Caverlee (Texas A&M University),
    Zhiyuan Cheng (Texas A&M University),
    Daniel Z. Sui (Ohio State University).

  • Context-based People Search in Labeled Social Networks (Short Paper)
    Cheng-Te Li (National Taiwan University)
    Man-Kwan Shan (National Chengchi University)
    Shou-De Lin (National Taiwan University)

  • Improving User Interest Inference From Social Neighbors(Short Paper)
    Zhen Wen (IBM T. J. Watson Research Center)
    Ching-Yung Lin (IBM T. J. Watson Research Center)

  • Practical Representations for Web and Social Graphs (Short Paper)
    Francisco Claude (University of Waterloo)
    Susana Ladra (Universidade da Coruña)

  • Social Ranking for Spoken Web Search (Short Paper)
    Shrey Sahay (IBM Research)
    Nitendra Rajput (IBM Research)
    Niketan Pansare (Rice University)

SODA 2012 Accepted Papers on Social Networks

October 22, 2011 Leave a comment

The following is a list of papers on social networks that are accepted in
SODA 2012 :

  • Ultra-Fast Rumor Spreading in Social Networks
    Nikolaos Fountoulakis, Konstantinos Panagiotou and Thomas Sauerwald

  • Networks Cannot Compute Their Diameter in Sublinear Time
    Silvio Frischknecht, Stephan Holzer and Roger Wattenhofer

WWW 2011 Accepted Papers on Social Networks

February 4, 2011 3 comments

WWW 2011 is to be held in Hyderabad, 2011. Here is the list of accepted papers in WWW 2011. The following are related to social networks:

1. Layered LPA: A MultiResolution Coordinate-Free Ordering for Compressing Social Networks
Sebastiano Vigna, Paolo Boldi, Massimo Santini and Marco Rosa

2. Track Globally, Deliver Locally: Improving Content Delivery Networks by Tracking Geographic Social Cascades
Salvatore Scellato, Cecilia Mascolo, Mirco Musolesi and Jon Crowcroft

3. We Know Who You Followed Last Summer: Inferring Social Link Creation Times In Twitter
Brendan Meeder, Brian Karrer, Amin Sayedi, R Ravi, Christian Borgs and Jennifer Chayes

4. Like like alike — Joint friendship and interest propagation in social networks
Shuang-hong Yang, Bo Long, Alex Smola, Narayanan Sadagopan, Zhaohui Zheng and Hongyuan Zha

5. Emergence of hierarchy in directed social networks
Mangesh Gupte, Pravin Shankar, Jing Li, Muthukrishnan and Liviu Iftode

6. Limiting the Spread of Misinformation in Social Networks
Ceren Budak, Divyakant Agrawal and Amr El Abbadi

7. Estimating Sizes of Social Networks via Biased Sampling
Liran Katzir, Edo Liberty and Oren Somekh

8. Modeling the Temporal Dynamics of Social Rating Networks using Bidirectional Effects of Social Relations and Rating Patterns
Mohsen Jamali, Gholamreza Haffari and Martin Ester

9. Milgram-Routing in Social Networks
Silvio Lattanzi, Alessandro Panconesi and D. Sivakumar

10. Differences in the Mechanics of Information Diffusion Across Topics: Idioms, Political Hashtags, and Complex Contagion on Twitter
Daniel Romero, Brendan Meeder and Jon Kleinberg

11. Network Bucket Testing
Lars Backstrom and Jon Kleinberg

12. Finding the bias and prestige of nodes in networks based on trust scores
Abhinav Mishra and Arnab Bhattacharya

Facebook Fellowship Program

January 7, 2011 Leave a comment

Facebook has stated graduate (Ph.D.) student fellowship program in the academic year 2010-2011. Now its time for applications for Facebook Graduate (Ph.D.) Students Fellowship Program for the academic year 2011-2012. The amazing issue for the academic year 2011-2012 is that Facebook is accepting applications from Ph.D. students studying at international universities in addition to applications from Ph.D. students studying in the United States. The following is the formal description of this fellowship as per Facebook website:

Every day Facebook confronts the most complex technical problems and we believe that close relationships with the academy will enable us to address many of these problems at a fundamental level and solve them. As part of our ongoing commitment to academic relations, we are pleased to announce the continuation of the Facebook Fellowship program to support graduate students in the 2011-2012 school year..

Each Facebook Fellowship includes:
· Tuition and fees will be paid for the academic year.
· $30K stipend (paid over 9 months of the academic year).
· $5K per year toward conference attendance and travel.
· $2.5K toward a personal computer.
· Opportunity to apply for a paid summer internship.
· Recipients are responsible for the taxation on any funds.

Topical Areas: Facebook is interested in a wide range of academic topics, including the following topical areas:

* Computational Advertising
* Computer Vision
* Compiler Technology
* Computer Architecture
* Computer Networking
* Computer Security
* Databases
* Data Mining
* Distributed Computing
* Fault Tolerance
* Human-Computer Interaction
* Internet Economics
* Machine Learning
* Machine Translation
* Natural Language Processing
* Search
* Smart Datacenters
* Social Computing

Application Timeline:
* December 20, 2010: Launch of Fellowship for 2011-2012 academic year
* February 28, 2011: Applications for fellowships must be submitted in full
* April 8, 2011: Award recipients will be notified by email of their acceptance

For more information, please visit Facebook Fellowship Program.

2010 in review

January 3, 2011 Leave a comment

The stats helper monkeys at WordPress.com mulled over how this blog did in 2010, and here’s a high level summary of its overall blog health:

Healthy blog!

The Blog-Health-o-Meter™ reads This blog is doing awesome!.

Crunchy numbers

Featured image

A helper monkey made this abstract painting, inspired by your stats.

A Boeing 747-400 passenger jet can hold 416 passengers. This blog was viewed about 1,400 times in 2010. That’s about 3 full 747s.

In 2010, there were 21 new posts, not bad for the first year! There were 6 pictures uploaded, taking up a total of 927kb.

The busiest day of the year was September 23rd with 26 views. The most popular post that day was Yahoo! Research Head Dr. Prabhakar Raghavan’s Interview Highlights on Social Influencers .

Where did they come from?

The top referring sites in 2010 were lcm.csa.iisc.ernet.in, clweb.csa.iisc.ernet.in, en.wordpress.com, basna.in, and s3.serc.iisc.ernet.in.

Some visitors came searching, mostly for ramasuri narayanam, leading researchers in social networks, innovations in computer science 2011, ramasuri blog, and sdm 2010 accepted papers.

Attractions in 2010

These are the posts and pages that got the most views in 2010.


Yahoo! Research Head Dr. Prabhakar Raghavan’s Interview Highlights on Social Influencers August 2010


WINE 2010 Papers on Social Networks September 2010


Innovations in Computer Science – ICS 2011 July 2010


About June 2010
1 comment


Leading Researchers and Groups in Social Networks with Computer Science Flavour July 2010

Categories: Uncategorized

SDM 2010 Accepted Papers Related to Social Networks

December 14, 2010 Leave a comment

Here is the list of accepted papers in SDM 2010. Here is a few of those papers that are related to social networks:

1. Grass: Graph Structure Summarization
Kristen Lefevre, University of Michigan, USA; Evimaria Terzi, Boston University, USA; Babis Tsourakakis, Carnegie Mellon University, USA

2, Predicting Customer Churn in Mobile Networks Through Analysis of Social Groups
Yossi Richter, Elad Yom-Tov, and Noam Slonim, IBM Haifa Research Lab, Israel

3. Directed Network Community Detection: A Popularity and Productivity Link Model
Tianbao Yang, Michigan State University, USA; Yun Chi, Shenghuo Zhu, and Yihong Gong, NEC Laboratories America, USA; Rong Jin, Michigan State University, USA

4. HCDF: A Hybrid Community Discovery Algorithm
Keith Henderson, Lawrence Livermore National Laboratory, USA