Fetching the paper…
Reading the bibliography…
Detecting anomalies in data is a vital task, with numerous high-impact applications in areas such as security, finance, health care, and law enforcement.
On lines and planes of closest fit to systems of points in space
Karl Pearson · 1901
Earlier work this paper cites.
Less is more: Sparse graph mining with compact matrix decomposition
Jimeng Sun, Yinglian Xie, Hui Zhang, and Christos Faloutsos · 1932
Earlier work this paper cites.
A new status index derived from sociometric analysis
Leo Katz · 1953
Earlier work this paper cites.
An introduction to probability theory and its applications
William Feller · 1968
Earlier work this paper cites.
Algebraic connectivity of graphs
Miroslav Fiedler · 1973
Earlier work this paper cites.
Comparison of graphs by their number of spanning trees
Alexander K. Kelmans · 1976
Earlier work this paper cites.
An algorithm for subgraph isomorphism
Julian R. Ullmann · 1976
Earlier work this paper cites.
A set of measures of centrality based upon betweenness
Linton C. Freeman · 1977
Earlier work this paper cites.
Identification of outliers
Douglas Hawkins · 1980
Earlier work this paper cites.
Approximations for distributions of scan statistics
Joseph I. Naus · 1982
Earlier work this paper cites.
Time Series Analysis, Forecasting and Control
George Edward Pelham Box and Gwilym Jenkins · 1990
Earlier work this paper cites.
The Computational Complexity of Probabilistic Inference Using Bayesian Belief Networks
Gregory F. Cooper · 1990
Earlier work this paper cites.
Indexing by latent semantic analysis
Scott Deerwester, Susan T. Dumais, George W. Furnas, Thomas K. Landauer, and Richard Harshman · 1990
Earlier work this paper cites.
Multi-interval discretization of continuous-valued attributes for classification learning
Usama M. Fayyad and Keki B. Irani · 1993
Earlier work this paper cites.
Statistical analysis of spherical data
N. I. Fisher, T. Lewis, and B. J. J. Embleton · 1993
Earlier work this paper cites.
Metis - unstructured graph partitioning and sparse matrix ordering system, version 2.0
George Karypis and Vipin Kumar · 1995
Earlier work this paper cites.
Combining data mining and machine learning for effective user profiling
Tom Fawcett and Foster J. Provost · 1996
Earlier work this paper cites.
Matrix computations (3rd ed.)
Gene H. Golub and Charles F. Van Loan · 1996
Earlier work this paper cites.
Parallel multilevel k-way partitioning scheme for irregular graphs
George Karypis and Vipin Kumar · 1996
Earlier work this paper cites.
Computing depth contours of bivariate point clouds
Ida Ruts and Peter J. Rousseeuw · 1996
Earlier work this paper cites.
A spatial scan statistic
Martin Kulldorff · 1997
Earlier work this paper cites.
Introduction to statistical quality control
Douglas C. Montgomery · 1997
Earlier work this paper cites.
Normalized cuts and image segmentation
Jianbo Shi and Jitendra Malik · 1997
Earlier work this paper cites.
The anatomy of a large-scale hypertextual web search engine
Sergey Brin and Lawrence Page · 1998
Earlier work this paper cites.
Graph similarity and distance in graphs
Gary Chartrand, Grzegorz Kubicki, and Michelle Schulz · 1998
Earlier work this paper cites.
Authoritative sources in a hyperlinked environment
Jon M. Kleinberg · 1998
Earlier work this paper cites.
Algorithms for mining distance-based outliers in large datasets
Edwin M. Knorr and Raymond T. Ng · 1998
Earlier work this paper cites.
Fraud detection in communication networks using neural and probabilistic methods
Michiaki Taniguchi, Michael Haft, Jaakko Hollmen, and Volker Tresp · 1998
Earlier work this paper cites.
Collective dynamics of ’small-world’ networks
Duncan J. Watts and Steven H. Strogatz · 1998
Earlier work this paper cites.
Emergence of scaling in random networks
Albert-László Barabási and Réka Albert · 1999
Earlier work this paper cites.
Detecting change in categorical data: Mining contrast sets
Stephen D. Bay and Michael J. Pazzani · 1999
Earlier work this paper cites.
When is ”nearest neighbor” meaningful?
Kevin Beyer, Jonathan Goldstein, Raghu Ramakrishnan, and Uri Shaft · 1999
Earlier work this paper cites.
Error correcting graph matching: On the influence of the underlying cost function
Horst Bunke · 1999
Earlier work this paper cites.
Activity monitoring: Noticing interesting changes in behavior
Tom Fawcett and Foster J. Provost · 1999
Earlier work this paper cites.
Learning probabilistic relational models
Nir Friedman, Lise Getoor, Daphne Koller, and Avi Pfeffer · 1999
Earlier work this paper cites.
Replicator equations, maximal cliques, and graph isomorphism
Marcello Pelillo · 1999
Earlier work this paper cites.
Hypothesis selection and testing by the MDL principle
Jorma Rissanen · 1999
Earlier work this paper cites.
Detection of abnormal change in dynamic networks
Peter Shoubridge, Miro Kraetzl, and David Ray · 1999
Earlier work this paper cites.
Small Worlds , volume 19
Duncan J. Watts · 1999
Earlier work this paper cites.
Lof: Identifying density-based local outliers
Markus M. Breunig, Hans-Peter Kriegel, Raymond T. Ng, and Jörg Sander · 2000
Earlier work this paper cites.
Hancock: a language for extracting signatures from data streams
Corinna Cortes, Kathleen Fisher, Daryl Pregibon, and Anne Rogers · 2000
Earlier work this paper cites.
Algorithms for non-negative matrix factorization
Daniel D. Lee and H. Sebastian Seung · 2000
Earlier work this paper cites.
Iterative classification in relational data
Jennifer Neville and David Jensen · 2000
Earlier work this paper cites.
Outlier detection for high dimensional data
Charu C. Aggarwal and Philip S. Yu · 2001
Earlier work this paper cites.
Unsupervised profiling methods for fraud detection
Richard J. Bolton and David J. Hand · 2001
Earlier work this paper cites.
Eigenvector-like measures of centrality for asymmetric relations
Phillip Bonacich and Paulette Lloyd · 2001
Earlier work this paper cites.
Signature-based methods for data streams
Corinna Cortes and Daryl Pregibon · 2001
Earlier work this paper cites.
Frequent subgraph discovery
Michihiro Kuramochi and George Karypis · 2001
Earlier work this paper cites.
BRITE: An approach to universal topology generation
Alberto Medina, Anukool Lakhina, Ibrahim Matta, and John W. Byers · 2001
Earlier work this paper cites.
On spectral clustering: Analysis and an algorithm
Andrew Y. Ng, Michael I. Jordan, and Yair Weiss · 2001
Earlier work this paper cites.
Statistical fraud detection: A review
Richard J. Bolton and David J. Hand · 2002
Earlier work this paper cites.
Very fast outlier detection in large multidimensional data sets
Amitabh Chaudhary, Alexander S. Szalay, and Andrew W. Moore · 2002
Earlier work this paper cites.
Communities of interest
Corinna Cortes, Daryl Pregibon, and Chris Volinsky · 2002
Earlier work this paper cites.
Median graphs and anomalous change detection in communication networks
Peter Dickinson, Horst Bunke, Arek Dadej, and Miro Kraetzl · 2002
Earlier work this paper cites.
SimRank: a measure of structural-context similarity
Glen Jeh and Jennifer Widom · 2002
Earlier work this paper cites.
Similarity flooding: A versatile graph matching algorithm and its application to schema matching
Sergey Melnik, Hector Garcia-Molina, and Erhard Rahm · 2002
Earlier work this paper cites.
Detection of abnormal change in a time series of graphs
Peter Shoubridge, Miro Kraetzl, Walter D. Wallis, and Horst Bunke · 2002
Earlier work this paper cites.
Discriminative probabilistic models for relational data
Benjamin Taskar, Pieter Abbeel, and Daphne Koller · 2002
Earlier work this paper cites.
Information-theoretic co-clustering
Inderjit S. Dhillon, Subramanyam Mallela, and Dharmendra S. Modha · 2003
Earlier work this paper cites.
Use of risk-adjusted cusum and rspert charts for monitoring in medial contexts
Olivia A. Grigg, Vern T. Farewell, and David J. Spiegelhalter · 2003
Earlier work this paper cites.
Topic-sensitive pagerank: A context-sensitive ranking algorithm for web search
Taher H. Haveliwala · 2003
Earlier work this paper cites.
Discovering cluster-based local outliers
Zengyou He, Xiaofei Xu, and Shengchun Deng · 2003
Earlier work this paper cites.
Marginalized kernels between labeled graphs
Hisashi Kashima, Koji Tsuda, and Akihiro Inokuchi · 2003
Earlier work this paper cites.
The link prediction problem for social networks
David Liben-Nowell and Jon M. Kleinberg · 2003
Earlier work this paper cites.
A symbolic representation of time series, with implications for streaming algorithms
Jessica Lin, Eamonn Keogh, Stefano Lonardi, and Bill Chiu · 2003
Earlier work this paper cites.
Link-based classification
Qing Lu and Lise Getoor · 2003
Earlier work this paper cites.
A simple relational classifier
Sofus Macskassy and Foster Provost · 2003
Earlier work this paper cites.
A mixture model and em-based algorithm for class discovery, robust classification, and outlier rejection in mixed labeled/unlabeled data sets
David J. Miller and John Browning · 2003
Earlier work this paper cites.
Collective classification with relational dependency networks
Jennifer Neville and David Jensen · 2003
Earlier work this paper cites.
Learning relational probability trees
Jennifer Neville, David Jensen, Lisa Friedland, and Michael Hay · 2003
Earlier work this paper cites.
Graph-based anomaly detection
Caleb C. Noble and Diane J. Cook · 2003
Earlier work this paper cites.
Loci: Fast outlier detection using the local correlation integral
Spiros Papadimitriou, Hiroyuki Kitagawa, Phillip B. Gibbons, and Christos Faloutsos · 2003
Earlier work this paper cites.
Finding groups of graphs in databases
Mitchell Peabody · 2003
Earlier work this paper cites.
Understanding belief propagation and its generalizations
Jonathan S. Yedidia, William T. Freeman, and Yair Weiss · 2003
Earlier work this paper cites.
Autopart: parameter-free graph partitioning and outlier detection
Deepayan Chakrabarti · 2004
Earlier work this paper cites.
Fast discovery of connection subgraphs
Christos Faloutsos, Kevin S. McCurley, and Andrew Tomkins · 2004
Earlier work this paper cites.
Learning with drift detection
Jo�o Gama, Pedro Medas, Gladys Castillo, and Pedro Rodrigues · 2004
Earlier work this paper cites.
Combating web spam with trustrank
Zoltán Gyöngyi, Hector Garcia-Molina, and Jan Pedersen · 2004
Earlier work this paper cites.
Eigenspace-based anomaly detection in computer systems
Tsuyoshi Idé and Hisashi Kashima · 2004
Earlier work this paper cites.
Why collective inference improves relational classification
David Jensen, Jennifer Neville, and Brian Gallagher · 2004
Cited alongside, same era.
Detecting community structure in networks
Mark E. J. Newman · 2004
Cited alongside, same era.
Finding and evaluating community structure in networks
Mark E. J. Newman and Michelle Girvan · 2004
Cited alongside, same era.
Random walks on complex networks
Jae Dong Noh and Heiko Rieger · 2004
Cited alongside, same era.
Minority report in fraud detection: classification of skewed data
Clifton Phua, Damminda Alahakoon, and Vincent Lee · 2004
Cited alongside, same era.
Outlier detection based on the distribution of distances between data points
Vydunas Saltenis · 2004
Cited alongside, same era.
OddBall: Spotting anomalies in weighted graphs
Leman Akoglu, Mary McGlohon, and Christos Faloutsos · 2010
Later among the works it cites.
A state of the art survey of fraud detection technology
Ulrich Flegel, Julien Vayssière, and Gunter Bitz · 2010
Later among the works it cites.
Subspace clustering meets dense subgraph mining: A synthesis of two paradigms
Stephan Günnemann, Ines Färber, Brigitte Boden, and Thomas Seidl · 2010
Later among the works it cites.
Bayesian anomaly detection methods for social networks
Nicholas A. Heard, David J. Weston, Kiriaki Platanioti, and David J. Hand · 2010
Later among the works it cites.
Metricforensics: A multi-level approach for mining volatile graphs
Keith Henderson, Tina Eliassi-Rad, Christos Faloutsos, Leman Akoglu, Lei Li, Koji Maruhashi, B. Aditya Prakash, and Hanghang Tong · 2010
Later among the works it cites.
Detecting anomalous traffic using communication graphs
Keisuke Ishibashi, Tsuyoshi Kondoh, Shigeaki Harada, Tatsuya Mori, Ryoichi Kawahara, and Shoichiro Asano · 2010
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Spamrank:� fully automatic link spam detection
András A. Benczúr, Károly Csalogány, Tamás Sarlós, and Máté Uher · 2005
Cited alongside, same era.
Feature bagging for outlier detection
Aleksandar Lazarevic and Vipin Kumar · 2005
Cited alongside, same era.
Graphs over time: densification laws, shrinking diameters and possible explanations
Jure Leskovec, Jon Kleinberg, and Christos Faloutsos · 2005
Cited alongside, same era.
Mining behavior graphs for ”backtrace” of noncrashing bugs
Chao Liu, Xifeng Yan, Hwanjo Yu, Jiawei Han, and Philip S. Yu · 2005
Cited alongside, same era.
Using relational knowledge discovery to prevent securities fraud
Jennifer Neville, Ozgur Simsek, David Jensen, John Komoroske, Kelly Palmer, and Henry G. Goldberg · 2005
Cited alongside, same era.
Anomaly detection in time series of graphs using arma processes
Brandon Pincombe · 2005
Cited alongside, same era.
Later among the works it cites.
Finding unusual review patterns using unexpected rules
Nitin Jindal, Bing Liu, and Ee-Peng Lim · 2010
Later among the works it cites.
Patterns on the connected components of terabyte-scale graphs
U Kang, Mary McGlohon, Leman Akoglu, and Christos Faloutsos · 2010
Later among the works it cites.
MetroSurv: detecting events in subway stations
Barbara Krausz and Rainer Herpers · 2010
Later among the works it cites.
The economics of click fraud
Nir Kshetri · 2010
Later among the works it cites.
Data mining to predict and prevent errors in health insurance claims processing
Mohit Kumar, Rayid Ghani, and Zhu-Song Mei · 2010
Later among the works it cites.
Uncovering Social Spammers: Social Honeypots + Machine Learning
Kyumin Lee, James Caverlee, and Steve Webb · 2010
Later among the works it cites.
Empirical comparison of algorithms for network community detection
Jure Leskovec, Kevin J. Lang, and Michael Mahoney · 2010
Later among the works it cites.
Detecting blackhole and volcano patterns in directed networks
Zhongmou Li, Hui Xiong, Yanchi Liu, and Aoying Zhou · 2010
Later among the works it cites.
Graph comparison using fine structure analysis
Owen Macindoe and Whitman Richards · 2010
Later among the works it cites.
Machine learning algorithms for event detection
Dragos D. Margineantu, Weng-Keen Wong, and Denver Dash · 2010
Later among the works it cites.
Adaptive outlierness for subspace outlier ranking
Emmanuel Müller, Matthias Schiffer, and Thomas Seidl · 2010
Later among the works it cites.
Distance-based outlier detection: Consolidation and renewed bearing
Gustavo Henrique Orair, Carlos H. C. Teixeira, Ye Wang, Wagner Meira Jr., and Srinivasan Parthasarathy · 2010
Later among the works it cites.
A comprehensive survey of data mining-based fraud detection research
Clifton Phua, Vincent C. S. Lee, Kate Smith-Miles, and Ross W. Gayler · 2010
Later among the works it cites.
gskeletonclu: Density-based network clustering via structure-connected tree division or agglomeration
Heli Sun, Jianbin Huang, Jiawei Han, Hongbo Deng, Peixiang Zhao, and Boqin Feng · 2010
Later among the works it cites.
Graph kernels
S. V. N. Vishwanathan, Nicol N. Schraudolph, Risi Imre Kondor, and Karsten M. Borgwardt · 2010
Later among the works it cites.
Outlier detection in graph streams
Charu C. Aggarwal, Yuchen Zhao, and Philip S. Yu · 2011
Later among the works it cites.
Dimensionality reduction for histogram features based on supervised non-negative matrix factorization
Mitsuru Ambai, Nugraha P. Utama, and Yuichi Yoshida · 2011
Later among the works it cites.
Prophiler: a fast filter for the large-scale detection of malicious web pages
Davide Canali, Marco Cova, Giovanni Vigna, and Christopher Kruegel · 2011
Later among the works it cites.
Detecting anomalies in graphs with numeric labels
Michael Davis, Weiru Liu, Paul Miller, and George Redpath · 2011
Later among the works it cites.
It’s who you know: graph mining using recursive structural features
Keith Henderson, Brian Gallagher, Lei Li, Leman Akoglu, Tina Eliassi-Rad, Hanghang Tong, and Christos Faloutsos · 2011
Later among the works it cites.
Graption: A graph-based P2P traffic classification framework for the internet backbone
Marios Iliofotou, Hyunchul Kim, Michalis Faloutsos, Michael Mitzenmacher, Prashanth Pappu, and George Varghese · 2011
Later among the works it cites.
Thinking, fast and slow
Daniel Kahneman · 2011
Later among the works it cites.
Unifying guilt-by-association approaches: Theorems and fast algorithms
Danai Koutra, Tai-You Ke, U Kang, Duen Horng Chau, Hsing-Kuo Kenneth Pao, and Christos Faloutsos · 2011
Later among the works it cites.
Scan Statistics for the Online Detection of Locally Anomalous Subgraphs
Josh Neil · 2011
Later among the works it cites.
Finding deceptive opinion spam by any stretch of the imagination
Myle Ott, Yejin Choi, Claire Cardie, and Jeffrey T. Hancock · 2011
Later among the works it cites.
One class classification for anomaly detection: Support vector data description revisited
Eric J. Pauwels and Onkar Ambekar · 2011
Later among the works it cites.
The Odd One Out: Identifying and characterising anomalies
Koen Smets and Jilles Vreeken · 2011
Later among the works it cites.
Finding communities in dynamic social networks
Chayant Tantipathananandh and Tanya Berger-Wolf · 2011
Later among the works it cites.
Non-negative residual matrix factorization with application to graph anomaly detection
Hanghang Tong and Ching-Yung Lin · 2011
Later among the works it cites.
Revisit dynamic arima based anomaly detection
Bonnie Zhu and Shankar Sastry · 2011
Later among the works it cites.
Outlier ensembles
Charu C. Aggarwal · 2012
Later among the works it cites.
Netsimile: A scalable approach to size-independent network similarity
Michele Berlingerio, Danai Koutra, Tina Eliassi-Rad, and Christos Faloutsos · 2012
Later among the works it cites.
Tracing clusters in evolving graphs with node attributes
Brigitte Boden, Stephan Günnemann, and Thomas Seidl · 2012
Later among the works it cites.
Anomaly detection for discrete sequences: A survey
Varun Chandola, Arindam Banerjee, and Vipin Kumar · 2012
Later among the works it cites.
Tourviz: interactive visualization of connection pathways in large graphs
Duen Horng Chau, Leman Akoglu, Jilles Vreeken, Hanghang Tong, and Christos Faloutsos · 2012
Later among the works it cites.
Detecting anomalies in bipartite graphs with mutual dependency principles
Hanbo Dai, Feida Zhu, Ee-Peng Lim, and HweeHwa Pang · 2012
Later among the works it cites.
Intrusion as (anti)social communication: characterization and detection
Qi Ding, Natallia Katenka, Paul Barford, Eric D. Kolaczyk, and Mark Crovella · 2012
Later among the works it cites.
Towards Online Spam Filtering in Social Networks
Hongyu Gao, Yan Chen, Kathy Lee, Diana Palsetia, and Alok Choudhary · 2012
Later among the works it cites.
Finding density-based subspace clusters in graphs with feature vectors
Stephan Günnemann, Brigitte Boden, and Thomas Seidl · 2012
Later among the works it cites.
Integrating community matching and outlier detection for mining evolutionary community outliers
Manish Gupta, Jing Gao, Yizhou Sun, and Jiawei Han · 2012
Later among the works it cites.
Measuring tie strength in implicit social networks
Mangesh Gupte and Tina Eliassi-Rad · 2012
Later among the works it cites.
RolX: structural role extraction & mining in large graphs
Keith Henderson, Brian Gallagher, Tina Eliassi-Rad, Hanghang Tong, Sugato Basu, Leman Akoglu, Danai Koutra, Christos Faloutsos, and Lei Li · 2012
Later among the works it cites.
Evilseed: A guided approach to finding malicious web pages
Luca Invernizzi and Paolo Milani Comparetti · 2012
Later among the works it cites.
Fast random walk graph kernel
U Kang, Hanghang Tong, and Jimeng Sun · 2012
Later among the works it cites.
Hics: High contrast subspaces for density-based outlier ranking
Fabian Keller, Emmanuel Müller, and Klemens Böhm · 2012
Later among the works it cites.
Tensorsplat: Spotting latent anomalies in time
Danai Koutra, Evangelos Papalexakis, and Christos Faloutsos · 2012
Later among the works it cites.
Outlier detection in arbitrarily oriented subspaces
Hans-Peter Kriegel, Peer Kröger, Erich Schubert, and Arthur Zimek · 2012
Later among the works it cites.
Symmetric nonnegative matrix factorization for graph clustering
Da Kuang, Haesun Park, and Chris H. Q. Ding · 2012
Later among the works it cites.
Outlier ranking via subspace analysis in multiple views of the data
Emmanuel Müller, Ira Assent, Patricia Iglesias, Yvonne Mülle, and Klemens Böhm · 2012
Later among the works it cites.
Unsupervised dimensionality reduction via gradient-based matrix factorization with two adaptive learning rates
Vladimir Nikulin and Tian-Hsiang Huang · 2012
Later among the works it cites.
Estimating the prevalence of deception in online review communities
Myle Ott, Claire Cardie, and Jeffrey T. Hancock · 2012
Later among the works it cites.
Parcube: Sparse parallelizable tensor decompositions
Evangelos E. Papalexakis, Christos Faloutsos, and Nicholas D. Sidiropoulos · 2012
Later among the works it cites.
Efficient and scalable socware detection in online social networks
Md Sazzadur Rahman, Ting-Kai Huang, Harsha V. Madhyastha, and Michalis Faloutsos · 2012
Later among the works it cites.
Role-dynamics: fast mining of large dynamic networks
Ryan A. Rossi, Brian Gallagher, Jennifer Neville, and Keith Henderson · 2012
Later among the works it cites.
Local outlier detection reconsidered: a generalized view on locality with applications to spatial, video, and network outlier detection
Erich Schubert, Arthur Zimek, and Hans-Peter Kriegel · 2012
Later among the works it cites.
Non-negative residual matrix factorization: problem definition, fast solutions, and applications
Hanghang Tong and Ching-Yung Lin · 2012
Later among the works it cites.
Using data mining technique to enhance tax evasion detection performance
Roung-Shiunn Wu, Chin-Shyh Ou, Hui ying Lin, She-I Chang, and David C. Yen · 2012
Later among the works it cites.
Review spam detection via temporal pattern discovery
Sihong Xie, Guan Wang, Shuyang Lin, and Philip S. Yu · 2012
Later among the works it cites.
A survey on unsupervised outlier detection in high-dimensional numerical data
Arthur Zimek, Erich Schubert, and Hans-Peter Kriegel · 2012
Later among the works it cites.
Outlier Analysis
Charu C. Aggarwal · 2013
Later among the works it cites.
Message passing algorithms for sparse network alignment
Mohsen Bayati, David F. Gleich, Amin Saberi, and Ying Wang · 2013
Later among the works it cites.
ASCOS: an asymmetric network structure context similarity measure
Hung-Hsuan Chen and C. Lee Giles · 2013
Later among the works it cites.
Outlier detection for temporal data: A survey
Manish Gupta, Jing Gao, Charu C. Aggarwal, and Jiawei Han · 2013
Later among the works it cites.
Svdd-based outlier detection on uncertain data
Bo Liu, Yanshan Xiao, Longbing Cao, Zhifeng Hao, and Feiqi Deng · 2013
Later among the works it cites.
Netspot: Spotting significant anomalous regions on dynamic networks
Misael Mongiovi, Petko Bogdanov, Razvan Ranca, Ambuj K. Singh, Evangelos E. Papalexakis, and Christos Faloutsos · 2013
Later among the works it cites.
Ranking outlier nodes in subspaces of attributed graphs
Emmanuel Müller, Patricia Iglesias, Yvonne Mülle, and Böhm Klemens · 2013
Later among the works it cites.
Modeling dynamic behavior in large evolving graphs
Ryan A. Rossi, Brian Gallagher, Jennifer Neville, and Keith Henderson · 2013
Later among the works it cites.
Evolutionary network analysis: A survey
Charu Aggarwal and Karthik Subbian · 2014
Closest in time.
Com2: Fast automatic discovery of temporal (comet) communities
Miguel Araujo, Spiros Papadimitriou, Stephan G�nnemann, Christos Faloutsos, Prithwish Basu, Ananthram Swami, Evangelos Papalexakis, and Danai Koutra · 2014
Closest in time.
Net-Ray: Visualizing and mining web-scale graphs
U Kang, Jay-Yoon Lee, Danai Koutra, and Christos Faloutsos · 2014
Closest in time.
Detecting change points in the large-scale structure of evolving networks
Leto Peel and Aaron Clauset · 2014
Closest in time.
Ensembles for unsupervised outlier detection: Challenges and research questions. a position paper
Arthur Zimek, Ricardo J.G.B. Campello, and Jörg Sander · 2014
Closest in time.