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
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
Browsing and visualizing digital bibliographic data
VISSYM'04 Proceedings of the Sixth Joint Eurographics - IEEE TCVG conference on Visualization
Center-piece subgraphs: problem definition and fast solutions
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Bias and controversy: beyond the statistical deviation
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Fast direction-aware proximity for graph mining
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
User-assisted similarity estimation for searching related web pages
Proceedings of the eighteenth conference on Hypertext and hypermedia
DBconnect: mining research community on DBLP data
Proceedings of the 9th WebKDD and 1st SNA-KDD 2007 workshop on Web mining and social network analysis
Colibri: fast mining of large static and dynamic graphs
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
Mining Research Communities in Bibliographical Data
Advances in Web Mining and Web Usage Analysis
ACM Computing Surveys (CSUR)
Large human communication networks: patterns and a utility-driven generator
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Audience selection for on-line brand advertising: privacy-friendly social network targeting
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Network anomaly detection based on Eigen equation compression
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Parallelizing Random Walk with Restart for large-scale query recommendation
Proceedings of the 2010 Workshop on Massive Data Analytics on the Cloud
On community outliers and their efficient detection in information networks
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Crowdsourcing and service delivery
IBM Journal of Research and Development
An automated approach for finding variable-constant pairing bugs
Proceedings of the IEEE/ACM international conference on Automated software engineering
Spatial outlier detection: random walk based approaches
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
TAGs: scalable threshold-based algorithms for proximity computation in graphs
Proceedings of the 14th International Conference on Extending Database Technology
GBASE: a scalable and general graph management system
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
A bipartite graph model and mutually reinforcing analysis for review sites
DEXA'11 Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part I
On kernel information propagation for tag clustering in social annotation systems
KES'11 Proceedings of the 15th international conference on Knowledge-based and intelligent information and engineering systems - Volume Part II
"Tell me more": finding related items from user provided feedback
DS'11 Proceedings of the 14th international conference on Discovery science
TOAST: a topic-oriented tag-based recommender system
WISE'11 Proceedings of the 12th international conference on Web information system engineering
GaMuSo: graph base music recommendation in a social bookmarking service
IDA'11 Proceedings of the 10th international conference on Advances in intelligent data analysis X
Fast and exact top-k search for random walk with restart
Proceedings of the VLDB Endowment
OddBall: spotting anomalies in weighted graphs
PAKDD'10 Proceedings of the 14th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part II
Non-negative residual matrix factorization: problem definition, fast solutions, and applications
Statistical Analysis and Data Mining
Isolating and analyzing fraud activities in a large cellular network via voice call graph analysis
Proceedings of the 10th international conference on Mobile systems, applications, and services
Efficient personalized pagerank with accuracy assurance
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
Cross-domain collaboration recommendation
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
gbase: an efficient analysis platform for large graphs
The VLDB Journal — The International Journal on Very Large Data Bases
PathRank: Ranking nodes on a heterogeneous graph for flexible hybrid recommender systems
Expert Systems with Applications: An International Journal
MultiAspectForensics: mining large heterogeneous networks using tensor
International Journal of Web Engineering and Technology
Analyzing the effectiveness of graph metrics for anomaly detection in online social networks
WISE'12 Proceedings of the 13th international conference on Web Information Systems Engineering
Anomaly, event, and fraud detection in large network datasets
Proceedings of the sixth ACM international conference on Web search and data mining
A semi-supervised graph-based algorithm for detecting outliers in online-social-networks
Proceedings of the 28th Annual ACM Symposium on Applied Computing
Discovering social media experts by integrating social networks and contents
ADC '12 Proceedings of the Twenty-Third Australasian Database Conference - Volume 124
QUBiC: An adaptive approach to query-based recommendation
Journal of Intelligent Information Systems
Discovery of extreme events-related communities in contrasting groups of physical system networks
Data Mining and Knowledge Discovery
Social influence locality for modeling retweeting behaviors
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Visualizing brand associations from web community photos
Proceedings of the 7th ACM international conference on Web search and data mining
Review: A review of novelty detection
Signal Processing
| 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 (Neighborhood formation), and 2) finding abnormal nodes (Anomaly detection). And we propose algorithms to compute the neighborhood for each node using random walk with restarts and graph partitioning; we also propose algorithms to identify abnormal nodes, using neighborhood information. We evaluate the quality of neighborhoods 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.