Fennel: Streaming Graph Partitioning for Massive Scale Graphs
[Co-authors: Christos Gkantsidis, Bozidar Radunovic, Milan Vojnovic]
Microsoft Technical Report
Rainbow Connectivity of Sparse Random Graphs
See journal version (EJC)
[Co-authors: Alan Frieze]
In RANDOM 2012
On Certain Properties of Random Apollonian Networks
[Co-authors: Alan Frieze]
In 9th Workshop on Algorithms and Models for the Web Graph (WAW 2012)
Earlier version: ,
Efficient Triangle Counting in Large Graphs via Degree-based Vertex Partitioning
[Co-authors: Mihail N. Kolountzakis, Gary L. Miller, Richard Peng] Internet Mathematics Invited Paper
Colorful Triangle Counting and a MapReduce Implementation
[Co-authors: Rasmus Pagh]
To appear, Information Processing Letters
Approximate Dynamic Programming using Halfspace Queries and Multiscale Monge decomposition
[Co-authors: Gary L. Miller, Richard Peng, Russell Schwartz]
In Symposium on Discrete Algorithms (SODA 2011 )
PEGASUS: Mining Peta-Scale Graphs
[Co-authors: U Kang, Christos Faloutsos]
In Knowledge and Information Systems (KAIS) Invited Journal Paper
Counting Triangles Using Projections
In Knowledge and Information Systems (KAIS) Invited Journal Paper
HADI: Mining Radii of Large Graphs
[Co-authors: U Kang, Ana Paula Appel, Christos Faloutsos, Jure Leskovec]
In ACM Transactions on Knowledge Discovery from Data (TKDD) Invited Journal Paper
Spectral Counting of Triangles via Element-Wise Sparsification and Triangle-based Link Recommendation
[Co-authors: Petros Drineas, Eirinaios Michelakis, Ioannis Koutis, Christos Faloutsos]
In Advances in Social Networks Analysis and Mining, Springer Invited Book Chapter
Large Scale Graph Mining With MapReduce: Diameter Estimation and Eccentricity Plots of Massive Graphs with Mining Applications
In Social Network Mining, Analysis and Research Trends: Techniques and Applications , IGI Invited Book Chapter
Counting Triangles in Large Real World Networks
In Graph Data Management: Techniques and Applications , IGI Invited Book Chapter
2010
Data Mining with MapReduce: Graph and Tensor Algorithms with Applications
Master Thesis, Machine Learning Department, CMU
Efficient Triangle Counting in Large Graphs via Degree-based Vertex Partitioning
[Co-authors: Mihail N. Kolountzakis, Gary L. Miller, Richard Peng]
In 7th Workshop on Algorithms and Models for the Web Graph (WAW 2010 ) Special Issue
On the Vulnerability of Large Graphs
[Co-authors: Hanghang Tong, B. Aditya Prakash, Tina Eliassi-Rad, Christos Faloutsos, Duen Horng Chau]
In IEEE International Conference on Data Mining (ICDM 2010)
Robust Unmixing of Tumor States in Array Comparative Genomic Hybridization Data
[Co-authors: David Tolliver, Ayshwarya Subramanian, Stanley Shackney, Russell Schwartz]
In International Conference on Intelligent Systems for Molecular Biology (ISMB 2010)
MACH: Fast Randomized Tensor Decompositions
(Arxiv Preprint )
In SIAM International Conference on Data Mining (SDM 2010)
Radius Plots for Mining Tera-byte Scale Graphs: Algorithms, Patterns, and Observations
[Co-authors: U Kang, Ana Paula Appel, Christos Faloutsos, Jure Leskovec]
In SIAM International Conference on Data Mining (SDM 2010) Special Issue
Robust Unmixing of Tumor States in Array Comparative Genomic Hybridization Data
[Co-authors: David Tolliver, Ayshwarya Subramanian, Stanley Shackney, Russell Schwartz]
In Bioinformatics, Oxford Journals
CGHTRIMMER: Discretizing noisy Array CGH Data
[Co-authors: David Tolliver, Maria Tsiarli, Stanley Shackney ,Russell Schwartz]
2009
PEGASUS: A Peta-Scale Graph Mining System - Implementation and Observations
[Co-authors: U Kang, Christos Faloutsos]
In IEEE International Conference on Data Mining (ICDM 2009) Best Application Paper Runner Up, Invited Journal paper
Large Graph-Mining: Power Tools and a Practitioner's Guide
[Co-authors: Gary L. Miller, Christos Faloutsos]
In ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, (KDD 2009) Video
DOULION: Counting Triangles in Massive Graphs With a Coin
[Co-authors: U Kang, Gary L. Miller, Christos Faloutsos]
In ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, (KDD 2009)
Spectral Counting of Triangles in Power-Law Graphs via Element-Wise Sparsification
[Co-authors: Petros Drineas, Eirinaios Michelakis, Ioannis Koutis, Christos Faloutsos]
In Advances in Social Networks Analysis and Mining (ASONAM 2009) Special Issue
VeWRA: An Algorithm for Wrapper Verification
[Co-authors: Georgios Paliouras] CMU ML Tech Report CMU-ML-09-100, 2009 Undergraduate work, an engineering effort to build a robust wrapper verification system.
BridgeFind: Fast Detection of Top-k Bridges in Large Graphs.
[Co-authors: Hanghang Tong, B. Aditya Prakash, Tina Eliassi-Rad, Christos Faloutsos, Duen Horng Chau]
Lawrence Livermore Technical Report, LLNL-TR-414449 (July 2009)
2008
Two heads better than one: pattern discovery in time-evolving multi-aspect data
[Co-authors: Jimeng Sun, Evan Hoke, Christos Faloutsos, Tina Eliassi-Rad]
In Data Mining and Knowledge Discovery (DM&KS) Invited Journal Paper
Fast Counting of Triangles in Large Real Networks, without counting: Algorithms and Laws
In IEEE International Conference on Data Mining (ICDM 2008) Special Issue
Two heads better than one: pattern discovery in time-evolving multi-aspect data
[Co-authors: Jimeng Sun, Evan Hoke, Christos Faloutsos, Tina Eliassi-Rad]
In European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML-PKDD 2008) Special Issue
HADI: Fast Diameter Estimation and Mining in Massive Graphs with Hadoop
[Co-authors: U Kang, Ana Paula Appel, Christos Faloutsos, Jure Leskovec] CMU ML Tech Report CMU-ML-08-117, 2008