Social information filtering: algorithms for automating “word of mouth”
CHI '95 Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
Multilevel k-way partitioning scheme for irregular graphs
Journal of Parallel and Distributed Computing
The anatomy of a large-scale hypertextual Web search engine
WWW7 Proceedings of the seventh international conference on World Wide Web 7
Outlier detection for high dimensional data
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Proceedings of the 11th international conference on World Wide Web
Modern Information Retrieval
SimRank: a measure of structural-context similarity
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
On clusterings-good, bad and spectral
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Information-theoretic co-clustering
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Fully automatic cross-associations
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Automatic multimedia cross-modal correlation discovery
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
AutoPart: parameter-free graph partitioning and outlier detection
PKDD '04 Proceedings of the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases
Empirical analysis of predictive algorithms for collaborative filtering
UAI'98 Proceedings of the Fourteenth conference on Uncertainty in artificial intelligence
Browsing and visualizing digital bibliographic data
VISSYM'04 Proceedings of the Sixth Joint Eurographics - IEEE TCVG conference on Visualization
ACM SIGKDD Explorations Newsletter
Anomaly detection in data represented as graphs
Intelligent Data Analysis
Hierarchical, Parameter-Free Community Discovery
ECML PKDD '08 Proceedings of the European conference on Machine Learning and Knowledge Discovery in Databases - Part II
Exploiting the Block Structure of Link Graph for Efficient Similarity Computation
PAKDD '09 Proceedings of the 13th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining
TANGENT: a novel, 'Surprise me', recommendation algorithm
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Intelligent hybrid approach to false identity detection
Proceedings of the 12th International Conference on Artificial Intelligence and Law
Finding the k-Most Abnormal Subgraphs from a Single Graph
DS '09 Proceedings of the 12th International Conference on Discovery Science
Parallelizing Random Walk with Restart for large-scale query recommendation
Proceedings of the 2010 Workshop on Massive Data Analytics on the Cloud
Term weighting evaluation in bipartite partitioning for text clustering
AIRS'08 Proceedings of the 4th Asia information retrieval conference on Information retrieval technology
Crowdsourcing and service delivery
IBM Journal of Research and Development
An expert system for detecting automobile insurance fraud using social network analysis
Expert Systems with Applications: An International Journal
Towards bipartite graph data management
CloudDB '10 Proceedings of the second international workshop on Cloud data management
Disclosing false identity through hybrid link analysis
Artificial Intelligence and Law
Joint cluster based co-clustering for clustering ensembles
ADMA'06 Proceedings of the Second international conference on Advanced Data Mining and Applications
SigSpot: mining significant anomalous regions from time-evolving networks (abstract only)
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Intrusion as (anti)social communication: characterization and detection
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
| Hi-index | 0.00 |
Many real applications can be modeled using bipartite graphs, such as users vs. files in a P2P system, traders vs. stocks in a financial trading system, conferences vs. authors in a scientific publication network, and so on. We introduce two operations on bipartite graphs: 1) identifying similar nodes (relevance search), and 2) finding nodes connecting irrelevant nodes (anomaly detection). And we propose algorithms to compute the relevance score for each node using random walk with restarts and graph partitioning; we also propose algorithms to identify anomalies, using relevance scores. We evaluate the quality of relevance search based on semantics of the datasets, and we also measure the performance of the anomaly detection algorithm with manually injected anomalies. Both effectiveness and efficiency of the methods are confirmed by experiments on several real datasets.