2014
DOI: 10.1016/j.knosys.2014.04.036
|View full text |Cite
|
Sign up to set email alerts
|

Analyzing future communities in growing citation networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
9
0

Year Published

2015
2015
2022
2022

Publication Types

Select...
6
2

Relationship

2
6

Authors

Journals

citations
Cited by 23 publications
(9 citation statements)
references
References 35 publications
0
9
0
Order By: Relevance
“…New keywords are hard to simulate since the content of the possible label of keywords is harder to extract. However, previous work suggested that analyzing papers by clusters of topics can assist in identifying possible labels of new clusters [ 45 ].…”
Section: Discussionmentioning
confidence: 99%
“…New keywords are hard to simulate since the content of the possible label of keywords is harder to extract. However, previous work suggested that analyzing papers by clusters of topics can assist in identifying possible labels of new clusters [ 45 ].…”
Section: Discussionmentioning
confidence: 99%
“…A network-based approach was proposed to overcome the rigidity of trend-based forecasting where the prediction is dependent on the type and shape of the technology growth curve used. Node prediction based on preferential attachment link prediction is proposed to classify whether the nodes in citation networks have a connection to a new node in the future [21], labeling the new nodes by utilizing the metadata of their neighboring nodes [22]. This showed that predicting nodes in bibliographic networks is possible based on the structural properties of the network.…”
Section: Identifying and Predicting New Topicsmentioning
confidence: 99%
“…Jung and Segev [41] proposed methods to analyze how communities change over time in the citation network graph without additional external information and based on node and link prediction and community detection.…”
Section: Mappingmentioning
confidence: 99%
“…For the agglomerative methods of CD, there are two commonly used algorithms: first, Newman's CD algorithm is a widely used agglomerative method that uses modularity to measure the goodness of the current partitioning; second, the recently developed Louvain method [65] is an agglomerative method and is commonly used because of its low computational complexity and high performance. When merging communities, the Louvain method considers not only the modularity but also the consolidation ratio [41]. Newman's algorithm is effective but slow, whereas Louvain's method is much more computationally efficient [66].…”
Section: Measure the Complex Network Structural Features Of The Sprtsmentioning
confidence: 99%