|
Research Area: Search Technologies |
Profile
Deepayan Chakrabarti obtained his B.Tech. from IIT Kanpur, and his Ph.D. from Carnegie Mellon University. He has worked on graph mining problems, including epidemic thresholds in viral propagation, clustering and community detection on graphs, and building realistic graph generators.He is interested in applying such techniques on large graph datasets such as the Web and large social networks. Recently, he has also been working on bandit formulations for online learning.
Recent Publications, Projects and News
- Mortal Multi-Armed Bandits D. Chakrabarti; R. Kumar; F. Radlinski; E. Upfal, NIPS, 2008
- Generating Succinct Titles for Web URLs D. Chakrabarti; R. Kumar; K. Punera, KDD, 2008
- A Graph-Theoretic Approach to Webpage Segmentation D. Chakrabarti; R. Kumar; K. Punera, WWW, 2008
- Contextual Advertising by Combining Relevance with Click Feedback Deepayan Chakrabarti; Deepak Agarwal; Vanja Josifovski, WWW, 2008
- Page-level Template Detection via Isotonic Smoothing D. Chakrabarti; R. Kumar; K. Punera, WWW, 2007
- Estimating Rates of Rare Events at Multiple Resolutions D. Agarwal; A. Broder; D. Chakrabarti; D. Diklic; V. Josifovski; M. Sayyadian, KDD, 2007
- Page-Level Template Detection via Isotonic Smoothing Deepayan Chakrabarti; Ravi Kumar; Kunal Punera, 16th International World Wide Web Conference, 2007 [view abstract]
- Multi-armed Bandit Problems with Dependent Arms Pandey, S. ; Chakrabarti, D. ; Agarwal, D., ICML, 2007
- Bandits for Taxonomies: A Model-based Approach Pandey, S. ; Agarwal, D. ; Chakrabarti, D. ; Josifovski, V., SDM, 2007
- Visualization of Large Networks with Min-cut Plots, A-plots and R-MAT D. Chakrabarti; C. Faloutsos; Y. Zhan, International Journal of Human-Computer Studies, 2007
- Information Survival Threshold in Sensor and P2P Networks J. Leskovec; D. Chakrabarti; C. Faloutsos; S. Madden; C. Guestrin; M. Faloutsos, INFOCOM, 2007
- Graph Mining: Laws, Generators and Algorithms D. Chakrabarti; C. Faloutsos, ACM Computing Surveys, 2006
- Evolutionary Clustering D. Chakrabarti; Ravi Kumar; A. Tomkins, KDD, 2006
- Realistic, Mathematically Tractable Graph Generation and Evolution, Using Kronecker Multiplication J. Leskovec; D. Chakrabarti; J. Kleinberg; C. Faloutsos, PKDD, 2005
- Neighborhood Formation and Anomaly Detection in Bipartite Graphs J. Sun; H. Qu; D. Chakrabarti; C. Faloutsos, ICDM, 2005
- NetMine: New Mining Tools for Large Graphs D. Chakrabarti; Y. Zhan; D. Blandford; C. Faloutsos; G. Blelloch, SDM Workshop on Link Analysis, Counter-terrorism and Privacy, 2004
- R-MAT: A Recursive Model for Graph Mining D. Chakrabarti; Y. Zhan; C. Faloutsos, SDM, 2004
- Fully Automatic Cross-Associations D. Chakrabarti; S. Papadimitriou; D. Modha; C. Faloutsos, KDD, 2004
- AutoPart: Parameter-Free Graph Partitioning and Outlier Detection D. Chakrabarti, PKDD, 2004
- A Real-Time Expectation Maximization Algorithm for Acquiring Multi-Planar Maps of Indoor Environments with Mobile Robots S. Thrun; C. Martin; Y. Liu; D. Hahnel; R. Emery-Montemerlo; D. Chakrabarti; W. Burgard, IEEE Transactions on Robotics and Automation, 2003