default search action
Deepayan Chakrabarti
Person information
- affiliation: Carnegie Mellon University, Pittsburgh, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i8]Akhil Jalan, Deepayan Chakrabarti
:
Strategic Contract Negotiation in Financial Networks. CoRR abs/2402.08779 (2024) - 2023
- [c42]Deepayan Chakrabarti
SURE: Robust, Explainable, and Fair Classification without Sensitive Attributes. KDD 2023: 179-189 - 2022
- [j12]Deepayan Chakrabarti
Robust linear classification from limited training data. Mach. Learn. 111(5): 1621-1649 (2022) - [c41]Deepayan Chakrabarti, Benjamin Fauber:
Robust High-Dimensional Classification From Few Positive Examples. IJCAI 2022: 1952-1958 - [c40]Deepayan Chakrabarti
Avoiding Biases due to Similarity Assumptions in Node Embeddings. KDD 2022: 56-65 - [i7]Akhil Jalan, Deepayan Chakrabarti
Incentive-Aware Models of Dynamic Financial Networks. CoRR abs/2212.06808 (2022) - 2021
- [j11]Deepayan Chakrabarti
Parameter-free robust optimization for the maximum-Sharpe portfolio problem. Eur. J. Oper. Res. 293(1): 388-399 (2021) - [c39]Xueyu Mao
Consistent Nonparametric Methods for Network Assisted Covariate Estimation. ICML 2021: 7435-7446 - [i6]Deepayan Chakrabarti:
Robust Linear Classification from Limited Training Data. CoRR abs/2110.01648 (2021)
2010 – 2019
- 2019
- [j10]Long Zhao
Portfolio Construction by Mitigating Error Amplification: The Bounded-Noise Portfolio. Oper. Res. 67(4): 965-983 (2019) - 2018
- [c38]Aditya Pal, Deepayan Chakrabarti
Label Propagation with Neural Networks. CIKM 2018: 1671-1674 - [c37]Xueyu Mao, Purnamrita Sarkar, Deepayan Chakrabarti:
Overlapping Clustering Models, and One (class) SVM to Bind Them All. NeurIPS 2018: 2130-2140 - [c36]Deepayan Chakrabarti
Joint Label Inference in Networks. WWW (Companion Volume) 2018: 483-487 - [i5]Xueyu Mao, Purnamrita Sarkar, Deepayan Chakrabarti:
Overlapping Clustering Models, and One (class) SVM to Bind Them All. CoRR abs/1806.06945 (2018) - 2017
- [j9]Deepayan Chakrabarti, Stanislav Funiak, Jonathan Chang, Sofus A. Macskassy:
Joint Label Inference in Networks. J. Mach. Learn. Res. 18: 59:1-59:39 (2017) - [c35]Xueyu Mao
On Mixed Memberships and Symmetric Nonnegative Matrix Factorizations. ICML 2017: 2324-2333 - [r2]Deepayan Chakrabarti:
Graph Mining. Encyclopedia of Machine Learning and Data Mining 2017: 581-584 - [i4]Xueyu Mao, Purnamrita Sarkar, Deepayan Chakrabarti:
Estimating Mixed Memberships with Sharp Eigenvector Deviations. CoRR abs/1709.00407 (2017) - 2016
- [c34]Aditya Pal, Amaç Herdagdelen, Sourav Chatterji, Sumit Taank, Deepayan Chakrabarti
Discovery of Topical Authorities in Instagram. WWW 2016: 1203-1213 - 2015
- [j8]Deepayan Chakrabarti
Traffic Shaping to Optimize Ad Delivery. ACM Trans. Economics and Comput. 3(2): 11:1-11:20 (2015) - [c33]Purnamrita Sarkar, Deepayan Chakrabarti, Peter J. Bickel:
The Consistency of Common Neighbors for Link Prediction in Stochastic Blockmodels. NIPS 2015: 3016-3024 - 2014
- [c32]Deepayan Chakrabarti, Stanislav Funiak, Jonathan Chang, Sofus A. Macskassy:
Joint Inference of Multiple Label Types in Large Networks. ICML 2014: 874-882 - [i3]Deepayan Chakrabarti, Stanislav Funiak, Jonathan Chang, Sofus A. Macskassy:
Joint Inference of Multiple Label Types in Large Networks. CoRR abs/1401.7709 (2014) - 2013
- [c31]Deepayan Chakrabarti
Speeding up large-scale learning with a social prior. KDD 2013: 650-658 - 2012
- [b1]Deepayan Chakrabarti, Christos Faloutsos
Graph Mining: Laws, Tools, and Case Studies. Synthesis Lectures on Data Mining and Knowledge Discovery, Morgan & Claypool Publishers 2012, ISBN 978-3-031-00775-0 - [j7]B. Aditya Prakash, Deepayan Chakrabarti
Threshold conditions for arbitrary cascade models on arbitrary networks. Knowl. Inf. Syst. 33(3): 549-575 (2012) - [c30]Purnamrita Sarkar, Deepayan Chakrabarti, Michael I. Jordan:
Nonparametric Link Prediction in Dynamic Networks. ICML 2012 - [c29]Deepayan Chakrabarti
Traffic shaping to optimize ad delivery. EC 2012: 302-318 - 2011
- [c28]B. Aditya Prakash, Deepayan Chakrabarti
Threshold Conditions for Arbitrary Cascade Models on Arbitrary Networks. ICDM 2011: 537-546 - [c27]Andrea Vattani, Deepayan Chakrabarti, Maxim Gurevich:
Preserving Personalized Pagerank in Subgraphs. ICML 2011: 793-800 - [c26]Deepayan Chakrabarti, Kunal Punera:
Event Summarization Using Tweets. ICWSM 2011 - [c25]Purnamrita Sarkar, Deepayan Chakrabarti
Theoretical Justification of Popular Link Prediction Heuristics. IJCAI 2011: 2722-2727 - [i2]Purnamrita Sarkar, Deepayan Chakrabarti, Michael I. Jordan:
Non-parametric Link Prediction. CoRR abs/1109.1077 (2011) - 2010
- [j6]Jure Leskovec, Deepayan Chakrabarti, Jon M. Kleinberg, Christos Faloutsos
Kronecker Graphs: An Approach to Modeling Networks. J. Mach. Learn. Res. 11: 985-1042 (2010) - [c24]Purnamrita Sarkar, Deepayan Chakrabarti, Andrew W. Moore:
Theoretical Justification of Popular Link Prediction Heuristics. COLT 2010: 295-307 - [c23]Deepayan Chakrabarti
The paths more taken: matching DOM trees to search logs for accurate webpage clustering. WWW 2010: 211-220 - [p1]Deepayan Chakrabarti, Christos Faloutsos
Graph Mining: Laws and Generators. Managing and Mining Graph Data 2010: 69-123 - [r1]Deepayan Chakrabarti:
Graph Mining. Encyclopedia of Machine Learning 2010: 469-471
2000 – 2009
- 2009
- [c22]Xuanhui Wang, Deepayan Chakrabarti
Mining broad latent query aspects from search sessions. KDD 2009: 867-876 - [c21]Ana Paula Appel, Deepayan Chakrabarti, Christos Faloutsos
ShatterPlots: Fast Tools for Mining Large Graphs. SDM 2009: 802-813 - [c20]Deepayan Chakrabarti
Quicklink selection for navigational query results. WWW 2009: 391-400 - 2008
- [j5]Deepayan Chakrabarti
Epidemic thresholds in real networks. ACM Trans. Inf. Syst. Secur. 10(4): 1:1-1:26 (2008) - [c19]Deepayan Chakrabarti
Generating succinct titles for web URLs. KDD 2008: 79-87 - [c18]Deepayan Chakrabarti, Ravi Kumar, Filip Radlinski, Eli Upfal:
Mortal Multi-Armed Bandits. NIPS 2008: 273-280 - [c17]Deepayan Chakrabarti
A graph-theoretic approach to webpage segmentation. WWW 2008: 377-386 - [c16]Deepayan Chakrabarti
Contextual advertising by combining relevance with click feedback. WWW 2008: 417-426 - [i1]Jure Leskovec, Deepayan Chakrabarti, Jon M. Kleinberg, Christos Faloutsos, Zoubin Ghahramani:
Kronecker Graphs: An Approach to Modeling Networks. CoRR abs/0812.4905 (2008) - 2007
- [j4]Deepayan Chakrabarti
Visualization of large networks with min-cut plots, A-plots and R-MAT. Int. J. Hum. Comput. Stud. 65(5): 434-445 (2007) - [c15]Sandeep Pandey, Deepayan Chakrabarti
Multi-armed bandit problems with dependent arms. ICML 2007: 721-728 - [c14]Deepayan Chakrabarti
Information Survival Threshold in Sensor and P2P Networks. INFOCOM 2007: 1316-1324 - [c13]Deepak Agarwal, Andrei Z. Broder, Deepayan Chakrabarti
Estimating rates of rare events at multiple resolutions. KDD 2007: 16-25 - [c12]Sandeep Pandey, Deepak Agarwal, Deepayan Chakrabarti
Bandits for Taxonomies: A Model-based Approach. SDM 2007: 216-227 - [c11]Deepayan Chakrabarti
Page-level template detection via isotonic smoothing. WWW 2007: 61-70 - 2006
- [j3]Deepayan Chakrabarti
Graph mining: Laws, generators, and algorithms. ACM Comput. Surv. 38(1): 2 (2006) - [c10]Deepayan Chakrabarti
Evolutionary clustering. KDD 2006: 554-560 - 2005
- [j2]Jimeng Sun, Huiming Qu, Deepayan Chakrabarti, Christos Faloutsos
Relevance search and anomaly detection in bipartite graphs. SIGKDD Explor. 7(2): 48-55 (2005) - [c9]Jimeng Sun
Neighborhood Formation and Anomaly Detection in Bipartite Graphs. ICDM 2005: 418-425 - [c8]Jure Leskovec, Deepayan Chakrabarti
Realistic, Mathematically Tractable Graph Generation and Evolution, Using Kronecker Multiplication. PKDD 2005: 133-145 - 2004
- [j1]Sebastian Thrun, Christian Martin, Yufeng Liu, Dirk Hähnel, Rosemary Emery-Montemerlo, Deepayan Chakrabarti
A real-time expectation-maximization algorithm for acquiring multiplanar maps of indoor environments with mobile robots. IEEE Trans. Robotics 20(3): 433-443 (2004) - [c7]Deepayan Chakrabarti
Fully automatic cross-associations. KDD 2004: 79-88 - [c6]Deepayan Chakrabarti
AutoPart: Parameter-Free Graph Partitioning and Outlier Detection. PKDD 2004: 112-124 - [c5]Deepayan Chakrabarti
R-MAT: A Recursive Model for Graph Mining. SDM 2004: 442-446 - 2003
- [c4]Yang Wang, Deepayan Chakrabarti
Epidemic Spreading in Real Networks: An Eigenvalue Viewpoint. SRDS 2003: 25-34 - 2002
- [c3]Deepayan Chakrabarti, Christos Faloutsos
F4: large-scale automated forecasting using fractals. CIKM 2002: 2-9 - 2001
- [c2]Yufeng Liu, Rosemary Emery, Deepayan Chakrabarti, Wolfram Burgard, Sebastian Thrun:
Using EM to Learn 3D Models of Indoor Environments with Mobile Robots. ICML 2001: 329-336 - [c1]Sebastian Thrun, Wolfram Burgard, Deepayan Chakrabarti, Rosemary Emery, Yufeng Liu, Christian Martin:
A Real-time Algorithm for Acquiring Multi-Planar Volumetric Models with Mobile Robots. ISRR 2001: 21-35
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-13 00:44 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: