Spectral clustering in telephone call graphs

No abstract is available for this paper.

• Publication year

  2007

• Venue

  WebKDD/SNA-KDD '07

• Publication date

  2007-08-12

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1145/1348549.1348559
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Structure of LiveJournal social network

  2007cited by this paper
• To randomize or not to randomize: space optimal summaries for hyperlink analysis

  2006cited by this paper
• On the structural properties of massive telecom call graphs: findings and implications

  2006cited by this paper
• Improved Approximation Algorithms for Large Matrices via Random Projections

  2006cited by this paper
• Structure and tie strengths in mobile communication networks

  2006cited by this paper
• Clique percolation in random networks.

  2005cited by this paper
• A divide-and-merge methodology for clustering

  2005cited by this paper
• Fixing two weaknesses of the Spectral Method

  2005cited by this paper
• The Spectra of Random Graphs with Given Expected Degrees

  2004cited by this paper
• Structure and evolution of blogspace

  2004cited by this paper
• Finding good nearly balanced cuts in power law graphs

  2004cited by this paper
• Limits of Spectral Clustering

  2004cited by this paper
• Clustering Large Graphs via the Singular Value Decomposition

  2004cited by this paper
• A novel evolutionary data mining algorithm with applications to churn prediction

  2003cited by this paper
• Eigenvalues of Random Power law Graphs

  2003cited by this paper
• Turning telecommunications call details to churn prediction: a data mining approach

  2002cited by this paper
• Mining knowledge-sharing sites for viral marketing

  2002cited by this paper
• The average distances in random graphs with given expected degrees

  2002cited by this paper
• Fast mining of massive tabular data via approximate distance computations

  2002cited by this paper
• A spectral method to separate disconnected and nearly-disconnected web graph components

  2001cited by this paper
• Spectral Relaxation for K-means Clustering

  2001cited by this paper
• A Random Walks View of Spectral Segmentation

  2001cited by this paper
• Contour and Texture Analysis for Image Segmentation

  2001cited by this paper
• A min-max cut algorithm for graph partitioning and data clustering

  2001cited by this paper
• On clusterings-good, bad and spectral

  2000cited by this paper
• A random graph model for massive graphs

  2000cited by this paper
• Segmentation using eigenvectors: a unifying view

  1999cited by this paper
• Fast Monte-Carlo algorithms for finding low-rank approximations

  1998cited by this paper
• Normalized cuts and image segmentation

  1997cited by this paper
• Brief Application Description; Visual Data Mining: Recognizing Telephone Calling Fraud

  1997influential reference
• NicheWorks - Interactive Visualization of Very Large Graphs

  1997cited by this paper
• Multiway partitioning via geometric embeddings, orderings, and dynamic programming

  1995cited by this paper
• Spectral Partitioning: The More Eigenvectors, The Better

  1995cited by this paper
• Recent directions in netlist partitioning: a survey

  1995cited by this paper
• Spectral K-Way Ratio-Cut Partitioning and Clustering

  1993cited by this paper
• SVDPACK: A Fortran-77 Software Library for the Sparse Singular Value Decomposition

  1992cited by this paper
• New spectral methods for ratio cut partitioning and clustering

  1991influential reference
• An algorithm for partitioning the nodes of a graph

  1981cited by this paper
• Algebraic connectivity of graphs

  1973cited by this paper
• Lower bounds for the partitioning of graphs

  1973cited by this paper

• The structure of co-publications multilayer network

  2021cites this paper
• The Case for Kendall's Assortativity

  2019cites this paper
• The dynamic evolution of social ties and user-generated content: a case study on a Douban group

  2017cites this paper
• Graph Data Anonymization, De-Anonymization Attacks, and De-Anonymizability Quantification: A Survey

  2017cites this paper
• Evaluating the security of anonymized big graph/structural data

  2016cites this paper
• Mining communities in social network based on information diffusion

  2016cites this paper
• Group Formation with Incomplete Profiles

  2016cites this paper
• Mining top-k influential nodes in social networks via community detection

  2015cites this paper
• Statistical analysis of Nomao customer votes for spots of France

  2015cites this paper
• CISRI: A Crime Investigation System Using the Relative Importance of Information Spreaders in Networks Depicting Criminals Communications

  2015cites this paper
• Influence Maximization on Large-Scale Mobile Social Network: A Divide-and-Conquer Method

  2015cites this paper
• Optimal Client-Server Assignment for Internet Distributed Systems

  2014cites this paper
• A Game-Theoretic Approach to Graph Clustering

  2014cites this paper
• Optimal Client-Server Assignment for Internet Distributed Systems T

  2014cites this paper
• Mobile social networks : system and applications

  2013cites this paper
• Characterizing diverse link patterns in complex networks: theory and applications

  2013cites this paper
• An ACO inspired weighting approach for the spectral partitioning of co-authorship networks

  2012cites this paper
• Mutual or Unrequited Love: Identifying Stable Clusters in Social Networks with Uni- and Bi-directional Links

  2012cites this paper
• Spatial Outlier Detection from GSM Mobility Data

  2012cites this paper
• On Spectral Partitioning of Co-authorship Networks

  2012cites this paper
• Spatial Outlier Detection for Mobility Profile Mining

  2012cites this paper
• Precise Location Acquisition of Mobility Data Using Cell-id

  2012cites this paper
• SOHAC: Efficient Storage of Tick Data That Supports Search and Analysis

  2012cites this paper
• A Graph-Based Churn Prediction Model for Mobile Telecom Networks

  2012cites this paper
• Optimal Client-Server Assignment for Internet Distributed Systems

  2011cites this paper
• Data Mining Applications of Singular Value Decomposition Miklós Kurucz

  2011cites this paper
• Analysis of Different Clustering Approaches for Grouping Users on the Basis of GSM Call Logs

  2011cites this paper
• Annals of Information Systems

  2011cites this paper
• Towards the analysis of co-authorship networks by iterative spectral partitioning

  2011cites this paper
• Socioscope: Human Relationship and Behavior Analysis in Social Networks

  2011cites this paper
• Data Mining Applications of Singular Value Decomposition

  2011influential citation
• An Efficient Approach Formulation of Social Groups of User Calls of GSM

  2011cites this paper
• Socioscope: Human Relationship and Behavior Analysis in Mobile Social Networks

  2010cites this paper
• Insider Threat Detection Using a Graph-Based Approach

  2010cites this paper
• Predicting social ties in mobile phone networks

  2010cites this paper
• Implementation, Management and Analysis of User Groups of GSM Database

  2010cites this paper
• Sign-based spectral clustering

  2010cites this paper
• Finding user groups on the basis of GSM logs - a survey

  2010cites this paper
• Geographically Organized Small Communities and the Hardness of Clustering Social Networks

  2010influential citation
• ASSURED WIRELESS NETWORKING: PEER- BASED VALIDATION VIA SPECTRAL CLUSTERING

  2010cites this paper
• Assured Wireless Networking: Peer-Based Validation via Spectral Clustering

  2010cites this paper
• Community-based greedy algorithm for mining top-K influential nodes in mobile social networks

  2010cites this paper
• Data privacy: the non-interactive setting

  2009cites this paper
• Methods for Web Spam Filtering

  2009cites this paper
• Bayesian Clustering of Block Structured Relational Data

  2009cites this paper
• Community mining on dynamic weighted directed graphs

  2009cites this paper
• anonymizing Social Networks

  2009cites this paper
• De-anonymizing Social Networks

  2009cites this paper
• Methods for Web Spam Filtering Ph.D. Thesis Summary

  2009cites this paper
• Large-scale principal component analysis on LiveJournal friends network

  2008cites this paper
• Discovery of Social Groups Using Call Detail Records

  2008cites this paper
• Telephone Call Network Data Mining: A Survey with Experiments

  2008cites this paper
• Who rated what: a combination of SVD, correlation and frequent sequence mining

  2007cites this paper
• KDD Cup 2007 task 1 winner report

  2007cites this paper
• WebKDD/SNAKDD 2007: web mining and social network analysis post-workshop report

  2007cites this paper
• Spectral clustering for multi-type relational data

  2006cites this paper