About Me

Hello, I am Aditya and am an Assistant Professor in the Computer Science Department at Virginia Tech. I am a citizen of India and a native of Bangalore, but was raised in Bhilai. My dad used to work for the Bhilai Steel Plant and my mother was a Sr. Lecturer in the M.G.M. School there. I also have a wonderful elder brother. I lived in Bombay for 4 years during my bachelors, and in Pittsburgh for 5 years during my Ph.D. Also, I like Cricket (the sport), Hindustani Classical music (I play the Tabla) and Calvin&Hobbes.

Education

• Ph.D. and M.S. in Computer Science: Carnegie Mellon University, Pittsburgh, USA 2007-2012
• B.Tech in Computer Science and Engineering: Indian Institute of Technology - Bombay, India 2003-2007
• Schooling (Class I to XII): Delhi Public School - Bhilai, India 1990-2003

Research Interests

If you are interested in joining the group: Thank you for your interest. Please see this first.

Here is a Research Statement.
How do opinions get formed in online forums? Which people should we immunize, to prevent an epidemic as fast as possible? How do malware and sofware spread in cyberspace? I am broadly interested in Data Mining, Applied Machine Learning and Databases with emphasis on solving big-data problems in networks and time-series. Some of the research questions I answer deal with understanding and managing efficiently, dynamical mechanisms (like propagation) on networks, occurring across natural, social and technological systems. My research combines theoretical analysis of models, developing efficient algorithms and empirical studies on tera-byte scale data. I have also interests in time-series modeling and mining, and have worked perviously in privacy and anomaly detection.

My advisor at CMU was Prof. Christos Faloutsos. Earlier at IIT Bombay, my advisor was Prof. S. Sudarshan where I worked on Query Optimization. Apart from Computer Science, I like Physics and World History.

Here is my Resume: PDF (last updated, December, 2012).

Publications: Conferences and Journals

Disclaimer: All pdfs here are the author's version of the work. They are posted here by permission of ACM/IEEE/Springer for your personal use, not for re-distribution. The definitive version was published in the respective conference proceedings/journal issue.

My DBLP entry (contains a subset of my publications)

(in reverse chronological order)

1. Fractional Immunization on Networks [PDF]
   B. Aditya Prakash, Lada Adamic, Theodore Iwashnya, Hanghang Tong and Christos Faloutsos
   in SDM 2013, Austin
2. Patterns amongst Competing Task Frequencies: Super-Linearities, and the Almond-DG model [PDF]
   Danai Koutra, Vaseilios Koutras, B. Aditya Prakash and Christos Faloutsos
   in PAKDD 2013, Gold Coast
3. Competing Memes Propagation on Networks: A Network Science Perspective [PDF]
   Xuetao Wei, Nicholas Valler, B. Aditya Prakash, Iulian Neamtiu, Michalis Faloutsos and Christos Faloutsos
   in IEEE Journal on Selected Areas in Communication (Special Issue on Network Science), 2013 (to appear)
4. Spotting Culprits in Epidemics: How many and Which ones? [PDF]
   B. Aditya Prakash, Jilles Vreeken and Christos Faloutsos
   in IEEE ICDM 2012, Brussels
   Invited to KAIS Journal Special Issue (ICDM Best papers)
5. Competing Meme Propagation on Networks: A Case Study of Composite Networks [PDF]
   Xuetao Wei, Nicholas Valler, B. Aditya Prakash, Iulian Neamtiu, Michalis Faloutsos and Christos Faloutsos
   in ACM SIGCOMM Computer Communication Review, October 2012
6. Gelling, and Melting, Large Graphs through Edge Manipulation [PDF]
   Hanghang Tong, B. Aditya Prakash, Tina Eliassi-Rad, Michalis Faloutsos and Christos Faloutsos
   in ACM CIKM 2012, Mauii
   Received the Best Paper Award (among all three DB, IR, KM tracks)
7. Rise and Fall Patterns of Information Diffusion: Model and Implications [PDF]
   Yasuko Matsubara, Yasushi Sakurai, B. Aditya Prakash, Lei Li and Christos Faloutsos
   in SIGKDD 2012, Beijing
8. Interacting Viruses on a Network: Can both survive? [PDF]
   Alex Beutel, B. Aditya Prakash, Roni Rosenfeld and Christos Faloutsos
   in SIGKDD 2012, Beijing
9. Threshold Conditions for Arbitrary Cascade Models on Arbitrary Networks [PDF]
   B. Aditya Prakash, Deepayan Chakrabarti, Michalis Faloutsos, Nicholas Valler, Christos Faloutsos
   in Knowledge and Information Systems Journal, Springer. 2012.
10. Winner-takes-all: Competing Viruses on fair-play networks [PDF]
    B. Aditya Prakash, Alex Beutel, Roni Rosenfeld, Christos Faloutsos
    in WWW 2012, Lyon
11. Threshold Conditions for Arbitrary Cascade Models on Arbitrary Networks [PDF] [extended arXiv version]
    B. Aditya Prakash, Deepayan Chakrabarti, Michalis Faloutsos, Nicholas Valler, Christos Faloutsos
    in IEEE ICDM 2011, Vancouver
    Invited to KAIS Journal Special Issue (ICDM Best papers)
12. Time Series Clustering: Complex is Simpler! [PDF]
    Lei Li, B. Aditya Prakash
    in ICML 2011, Bellevue
13. Epidemic Spread in Mobile Ad Hoc Networks: Determining the Tipping Point [PDF]
    Nicholas Valler, B. Aditya Prakash, Hanghang Tong, Michalis Faloutsos, Christos Faloutsos
    in IFIP NETWORKING 2011, Valencia
14. On the Vulnerability of Large Graphs [PDF][CODE]
    Hanghang Tong, B. Aditya Prakash, Charalampos Tsourakakis, Tina Eliassi-Rad, Christos Faloutsos, Duen Horng Chau
    in IEEE ICDM 2010, Sydney
15. Virus Propagation on Time-Varying Networks: Theory and Immunization Algorithms [PDF]
    B. Aditya Prakash, Hanghang Tong, Nicholas Valler, Michalis Faloutsos, Christos Faloutsos
    in ECML-PKDD 2010, Barcelona
16. Parsimonious Linear Fingerprinting for Time Series [PDF][CODE]
    Lei Li, B. Aditya Prakash, Christos Faloutsos
    in VLDB 2010, Singapore
17. MetricForensics: A Multi-Level Approach for Mining Volatile Graphs [PDF]
    Keith Henderson, Tina Eliassi-Rad, Christos Faloutsos, Leman Akoglu, Lei Li, Koji Maruhashi, B. Aditya Prakash, Hanghang Tong
    in SIGKDD 2010, Washington DC
    
18. EigenSpokes: Surprising Patterns and Scalable Community Chipping in Large Graphs [PDF][CODE]
    B. Aditya Prakash, Ashwin Sridharan, Mukund Seshadri, Sridhar Machiraju, Christos Faloutsos
    in PAKDD 2010, Hyderabad
19. BGP-lens: Patterns and Anomalies in Internet Routing Updates [PDF][CODE]
    B. Aditya Prakash, Nicholas Valler, David Andersen, Michalis Faloutsos, Christos Faloutsos
    in SIGKDD 2009, Paris
20. FRAPP: A framework for high-accuracy privacy-preserving mining [PDF]
    Shipra Agrawal, Jayant R. Haritsa, B. Aditya Prakash
    in Data Mining and Knowldge Discovery Journal, Springer, 2008
21. Complex Group-by Queries for XML [PDF]
    C. Gokhale, N. Gupta, P. Kumar, L. V. S. Lakshmanan, R. Ng, B. Aditya Prakash
    in ICDE 2007, Istanbul, Turkey

Other Publications: Invited Articles and Workshops

1. Propagation and Immunization in Large Networks [PDF]
   B. Aditya Prakash
   Invited Article in Crossroads: The ACM Magazine for Students-Big Data Issue
2. Formalizing the BGP stability problem: Patterns and a Chaotic model
   B. Aditya Prakash, Michalis Faloutsos, Christos Faloutsos
   CMU-TR, Preliminary Version in IEEE INFOCOM NetSciCom Workshop 2011
   
3. Surprising Patterns and Scalable Community Detection in Large Graphs [PDF]
   B. Aditya Prakash, Ashwin Sridharan, Mukund Seshadri, Sridhar Machiraju, Christos Faloutsos
   in IEEE ICDM Large Scale Data Mining Workshop 2009

Theses

1. Understanding and Managing Propagation on Large Networks: Theory, Algorithms and Models [PDF]
   B. Aditya Prakash
   Ph.D. Thesis, Carnegie Mellon University, 2012
2. On Query Optimization Issues in Fine-Grained Authorization
   B. Aditya Prakash
   B.Tech Thesis, IIT Bombay, 2007

Talks/Tutorials

An unsorted list HERE.

1. Understanding and Managing Cascades in Large Graphs [LINK]
   B. Aditya Prakash and Christos Faloutsos
   Tutorial at ECML/PKDD 2012, Bristol
2. Understanding and Managing Cascades in Large Graphs [LINK]
   B. Aditya Prakash and Christos Faloutsos
   Tutorial at VLDB 2012, Istanbul

Patents

1. Determining User Communities in Communication Networks
   Ashwin Sridharan, Mukund Seshadri, James Schneider, B. Aditya Prakash, Christos Faloutsos, Sridhar Machiraju
   filed by Sprint Inc. in March 2010
2. Analysis of Computer Network Activity by Successively Removing Accepted Types of Access Events
   B. Aditya Prakash, Alice Zheng, Jack Stokes, Eric Fitzgerald, Theodore Hardy
   filed by Microsoft Inc. in April 2010

Software Tools

1. Netshield: fast algorithm to reduce vulnerability of static graphs [CODE]
2. PLiF: efficient method to learn sparse, interpretable and useful features from set of time-series [CODE]
3. SpokEn: effective community detection on large social networks [CODE]
4. BGP-Lens: tool to quickly find hidden anomalies in bursty time-sequences [CODE]

Service Activities

2013: PC Member for SDM 2013, IJCAI 2013, AAAI 2013

Collaborators

Some of the people I had the opportunity to work with (in alphabetical order)
Lada Adamic, David Andersen, Deepayan Chakrabarti, Anirban Dasgupta, Christos Faloutsos, Michalis Faloutsos, Varun Gupta, Maxim Gurevich, Theodore Iwashnya, Lei Li, Laks Lakshmananan, Sridhar Machiraju, Kunal Punera, Roni Rosenfeld, S. Sudarshan, Jack Stokes, Hanghang Tong, Nicholas Valler, Alice Zheng

Contact

Office Knowledge Works II, 2223 Computer Science Department Virginia Tech. 2202 Kraft Drive Blacksburg, VA 24060 USA

Phone Call: +1-540-231-0906 Fax: +1-540-231-4240

Email invert(cs.vt.edu @ badityap)