Understanding Importance of Collaborations in Co-authorship Networks: A Supportiveness Analysis Approach
Published 30 April 2009
Yi Han, Bin Zhou, Jian Pei, Yan Jia
Citations41
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
This paper introduces a novel and interesting “supportiveness” measure on co-authorship relation, and proposes several supportiveness measures, and exploits a supportiveness-based author ranking scheme.
Abstract
Previous chapter Next chapter Full AccessProceedings Proceedings of the 2009 SIAM International Conference on Data Mining (SDM)Understanding Importance of Collaborations in Co-authorship Networks: A Supportiveness Analysis ApproachYi Han, Bin Zhou, Jian Pei, and Yan JiaYi Han, Bin Zhou, Jian Pei, and Yan Jiapp.1112 - 1123Chapter DOI:https://doi.org/10.1137/1.9781611972795.95PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAboutAbstract Co-authorship networks, an important type of social networks, have been studied extensively from various angles such as degree distribution analysis, social community extraction and social entity ranking. Most of the previous studies consider the co-authorship relation between two authors as a collaboration. In this paper, we introduce a novel and interesting "supportiveness" measure on co-authorship relation. The fact that two authors co-author one paper can be regarded as one author supports the other's scientific work. We propose several supportiveness measures, and exploit a supportiveness-based author ranking scheme. Several efficient algorithms are developed to compute the top-n most supportive authors. Moreover, we extend the supportiveness analysis to community extraction, and develop feasible solutions to identify the most supportive groups of authors. The empirical study conducted on a large real data set indicates that the supportiveness measures are interesting and meaningful, and our methods are effective and efficient in practice. Previous chapter Next chapter RelatedDetails Published:2009ISBN:978-0-89871-682-5eISBN:978-1-61197-279-5 https://doi.org/10.1137/1.9781611972795Book Series Name:ProceedingsBook Code:PR133Book Pages:1-1244
Keywords
Computer SciencePhysics and Astronomy
Physical Review EFinding and evaluating community structure in networks
13,892 Citations2004Michelle G. Newman, Michelle Girvan
It is demonstrated that the algorithms proposed are highly effective at discovering community structure in both computer-generated and real-world network data, and can be used to shed light on the sometimes dauntingly complex structure of networked systems.
The PageRank Citation Ranking : Bringing Order to the Web
12,645 Citations1999Lawrence M. Page, Sergey Brin +2 more
This paper describes PageRank, a mathod for rating Web pages objectively and mechanically, effectively measuring the human interest and attention devoted to them, and shows how to efficiently compute PageRank for large numbers of pages.
NatureDiameter of the World-Wide Web
4,285 Citations1999Réka Albert, Hawoong Jeong +1 more
The World-Wide Web becomes a large directed graph whose vertices are documents and whose edges are links that point from one document to another, which determines the web's connectivity and consequently how effectively the authors can locate information on it.
Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topicsScientific collaboration networks. II. Shortest paths, weighted networks, and centrality
2,612 Citations2001M. E. J. Newman
It is argued that simple networks such as these cannot capture variation in the strength of collaborative ties and proposed a measure of collaboration strength based on the number of papers coauthored by pairs of scientists, and thenumber of other scientists with whom they coauthored those papers.
Reducibility Among Combinatorial Problems
2,450 Citations2009Richard M. Karp
Throughout the 1960s I worked on combinatorial optimization problems including logic circuit design with Paul Roth and assembly line balancing and the traveling salesman problem with Mike Held, which made me aware of the importance of distinction between polynomial-time and superpolynomial-time solvability.
NatureThe origin of bursts and heavy tails in human dynamics
2,285 Citations2005Albert-Ĺaszló Barabási
Graphs over time
2,264 Citations2005Jure Leskovec, Jon Kleinberg +1 more
A new graph generator is provided, based on a "forest fire" spreading process, that has a simple, intuitive justification, requires very few parameters (like the "flammability" of nodes), and produces graphs exhibiting the full range of properties observed both in prior work and in the present study.
gSpan: graph-based substructure pattern mining
2,030 Citations2003Xifeng Yan, Jiawei Han
A novel algorithm called gSpan (graph-based substructure pattern mining), which discovers frequent substructures without candidate generation by building a new lexicographic order among graphs, and maps each graph to a unique minimum DFS code as its canonical label.
Symposium on Discrete AlgorithmsAuthoritative sources in a hyperlinked environment
1,836 Citations1998Jon Kleinberg
Lecture notes in computer scienceAn Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data
1,029 Citations2000Akihiro Inokuchi, Takashi Washio +1 more
A novel approach named AGM to efficiently mine the association rules among the frequently appearing substructures in a given graph data set through the extended algorithm of the basket analysis is proposed.
ACM SIGKDD Explorations NewsletterLink mining
977 Citations2005Lise Getoor, Christopher Diehl
While network analysis has been studied in depth in particular areas such as social network analysis, hypertext mining, and web analysis, only recently has there been a cross-fertilization of ideas among these different communities.
ACM SIGMOD RecordInfluence sets based on reverse nearest neighbor queries
517 Citations2000Flip Korn, S. Muthukrishnan
Journal of InformetricsFinding scientific gems with Google’s PageRank algorithm
465 Citations2006P. Chen, Haoxuan Xie +2 more
The Google PageRank algorithm is applied to assess the relative importance of all publications in the Physical Review family of journals from 1893 to 2003 to identify some exceptional papers or “gems” that are universally familiar to physicists.
The European Physical Journal BFinding communities in linear time: a physics approach
456 Citations2004F. Wu, Bernardo A. Huberman
The European Physical Journal B (EPJ B) publishes regular articles and colloquia in Condensed Matter and Complex Systems on the range of topics including Solid State and Materials, Computational Methods, Statistical and Nonlinear Physics, and Interdisciplinary Physics.
ACM SIGKDD Explorations NewsletterState of the art of graph-based data mining
446 Citations2003Takashi Washio, Hiroshi Motoda
This article introduces the theoretical basis of graph based data mining and surveys the state of the art of graph-based data mining.
Communities and TechnologiesEmail as Spectroscopy: Automated Discovery of Community Structure within Organizations
429 Citations2003Joshua R. Tyler, Dennis M. Wilkinson +1 more
The MIT Press eBooksSmall-World Phenomena and the Dynamics of Information
386 Citations2002Jon Kleinberg
It is found that short chains are pervasive, and that people are able to find them, and this latter point is concerned precisely with a type of decentralized navigation in a social network, consisting of people as nodes and links joining.
ScholarlyCommons (University of Pennsylvania)Search through systematic set enumeration
334 Citations1992Ron Rymon
The Set-Enumerations (SE)tree is presented as a vehicle for representing sets and/or enumerating them in a best-first fashion and its usefulness as the basis for a unifying search-based framework for domains where minimal (maximal) elements of a power set are targeted.
The Information SocietyE-Mail as Spectroscopy: Automated Discovery of Community Structure within Organizations
330 Citations2005Joshua R. Tyler, Dennis M. Wilkinson +1 more
A betweenness centrality algorithm is used that can rapidly find communities within a graph representing information flows and is effective at identifying true communities, both formal and informal, within these scale-free graphs.
On mining cross-graph quasi-cliques
245 Citations2005Jian Pei, Daxin Jiang +1 more
An efficient algorithm is developed, Crochet, which exploits several interesting and effective techniques and heuristics to efficaciously mine cross-graph quasi-cliques, which is generalized from several interesting applications such as cross-market customer segmentation and joint mining of gene expression data and protein interaction data.
ACM SIGMOD RecordAnalysis of SIGMOD's co-authorship graph
138 Citations2003Mário A. Nascimento, Jörg Sander +1 more
The co-authorship graph obtained from all papers published at SIGMOD between 1975 and 2002 is investigated, finding some interesting facts, for instance, the identity of the authors who, on average, are "closest" to all other authors at a given time.
ScientometricsAuthor productivity and geodesic distance in bibliographic co-authorship networks, and visibility on the Web
126 Citations2004Hildrun Kretschmer
New methods concerning the position of highly productive authors in the network are developed and a relationship of distribution of these authors among the clusters in the co-authorship network could be proved to be dependent upon the size of the clusters.
Proceedings of the VLDB EndowmentFINCH
105 Citations2008Wei Wu, Fei Yang +2 more
An algorithm named INCH is presented that can compute a RkNN query's search region (from which the query result candidates are drawn) and a method that enables us to apply any RKNN algorithm on bichromatic Rknn queries.
Collaboration over time
104 Citations2008Jian Huang, Ziming Zhuang +2 more
A novel stochastic model, Stochastic Poisson model with Optimization Tree (Spot) is proposed to efficiently predict any increment of collaboration based on the local neighborhood structure and empirical results show that Spot outperforms Support Vector Regression by better fitting collaboration records and predicting the rate of collaboration.
Elsevier eBooksReverse Nearest Neighbor Aggregates Over Data Streams
102 Citations2002Flip Korn, S. Muthukrishnan +1 more
This paper presents efficient algorithms to approximately answer these RNNA queries over data streams with error guarantees, and provides analytical proofs of constant factor approximations for manyRNNA queries, and complement the analyses with experimental evidence of the accuracy of the techniques.
Proximity Tracking on Time-Evolving Bipartite Graphs
93 Citations2008Hanghang Tong, Spiros Papadimitriou +2 more
IEEE Transactions on Knowledge and Data EngineeringReverse nearest neighbors in large graphs
82 Citations2006Man Lung Yiu, Dimitris Papadias +2 more
A fundamental lemma is provided, which can be used to prune the search space while traversing the graph in search for RNN, and two RNN methods are developed; an eager algorithm that attempts to prunes network nodes as soon as they are visited and a lazy technique that prunes thesearch space when a data point is discovered.
ACM SIGIR ForumAnalysis of papers from twenty-five years of SIGIR conferences
65 Citations2002Alan F. Smeaton, Gary Keogh +3 more
CLAN: An Algorithm for Mining Closed Cliques from Large Dense Graph Databases
61 Citations2006Jianyong Wang, Zhiping Zeng +1 more
This paper develops a new algorithm, CLAN, to mine the frequent closed cliques, the most coherent structures in the graph setting, and shows that CLAN is very efficient for large dense graph databases with which the traditional graph mining algorithms fail.
ProceedingsImproving Grouped-Entity Resolution Using Quasi-Cliques
52 Citations2006Byung-Won On, Ergin Elmacioglu +3 more
This paper presents the experience of applying a recently proposed graph mining technique, Quasi-Clique, atop conventional ER solutions, and exploits contextual information mined from the group of elements per entity in addition to syntactic similarity.
An expert recommendation system using concept-based relevance discernment
26 Citations2002Toshihiro YUKAWA, Kaname Kasahara +2 more
An expert recommendation system using concept-based relevance discernment is proposed, which processes the description of a technical topic as input and then finds engineers who have a high level of expertise in that area.
Knowledge-based data mining
23 Citations2003Sholom M. Weiss, Stephen J. Buckley +2 more
Techniques for combining two types of knowledge systems: expert and machine learning, both of which represent information by logical decision rules or trees are described.
Sketching Landscapes of Page Farms
9 Citations2007Bin Zhou, Jian Pei
The notion of page farm is proposed, which is the set of pages contributing to (a major portion of) the PageRank score of a target page, and a simple greedy algorithm is developed, which tends to follow the power law distribution.