Partitioning sparse matrices with eigenvectors of graphs
SIAM Journal on Matrix Analysis and Applications
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
Proceedings of the 11th international conference on World Wide Web
The DBLP Computer Science Bibliography: Evolution, Research Issues, Perspectives
SPIRE 2002 Proceedings of the 9th International Symposium on String Processing and Information Retrieval
SimRank: a measure of structural-context similarity
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Analysis of SIGMOD's co-authorship graph
ACM SIGMOD Record
Email as spectroscopy: automated discovery of community structure within organizations
Communities and technologies
Automatic multimedia cross-modal correlation discovery
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Manifold-ranking based image retrieval
Proceedings of the 12th annual ACM international conference on Multimedia
Neighborhood Formation and Anomaly Detection in Bipartite Graphs
ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
Fast Random Walk with Restart and Its Applications
ICDM '06 Proceedings of the Sixth International Conference on Data Mining
Analysing social networks within bibliographical data
DEXA'06 Proceedings of the 17th international conference on Database and Expert Systems Applications
WebKDD/SNAKDD 2007: web mining and social network analysis post-workshop report
ACM SIGKDD Explorations Newsletter - Special issue on visual analytics
Conference Mining via Generalized Topic Modeling
ECML PKDD '09 Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases: Part I
Semantic relatedness hits bibliographic data
Proceedings of the eleventh international workshop on Web information and data management
Mining Social Networks on the Mexican Computer Science Community
MICAI '09 Proceedings of the 8th Mexican International Conference on Artificial Intelligence
Collaboration recommendation on academic social networks
ER'10 Proceedings of the 2010 international conference on Advances in conceptual modeling: applications and challenges
Hierarchical topic-based communities construction for authors in a literature database
IEA/AIE'10 Proceedings of the 23rd international conference on Industrial engineering and other applications of applied intelligent systems - Volume Part II
Metadatapedia: a proposal for aggregating metadata on data archiving
Proceedings of the 2012 iConference
Group topic modeling for academic knowledge discovery
Applied Intelligence
Mining potential research synergies from co-authorship graphs using power graph analysis
International Journal of Web Engineering and Technology
Evolution of Author's Topic in Authorship Network
ASONAM '12 Proceedings of the 2012 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012)
Mining research abstracts for exploration of research communities
Proceedings of the 5th ACM COMPUTE Conference: Intelligent & scalable system technologies
Indirect weighted association rules mining for academic network collaboration recommendations
AusDM '12 Proceedings of the Tenth Australasian Data Mining Conference - Volume 134
Information Sciences: an International Journal
| Hi-index | 0.00 |
Extracting information from large collections of structured, semi-structured or even unstructured data can be a considerable challenge when much of the hidden information is implicit within relationships among entities within the data. Social networks are such data collections in which relationships play a vital role in the knowledge these networks can convey. A bibliographic database is an essential tool for the research community, yet finding and making use of relationships comprised within such a social network is difficult. In this paper we introduce DBconnect, a prototype that exploits the social network coded within the DBLP database by drawing on a new random walk approach to reveal interesting knowledge about the research community and even recommend collaborations.