-
Zhao, S.X.; Zhang, P.L.; Li, J.; Tan, A.M.; Ye, F.Y.: Abstracting the core subnet of weighted networks based on link strengths (2014)
0.03
0.030759662 = product of:
0.09227899 = sum of:
0.09227899 = product of:
0.18455797 = sum of:
0.18455797 = weight(_text_:networks in 1256) [ClassicSimilarity], result of:
0.18455797 = score(doc=1256,freq=14.0), product of:
0.22247115 = queryWeight, product of:
4.72992 = idf(docFreq=1060, maxDocs=44218)
0.047034867 = queryNorm
0.8295816 = fieldWeight in 1256, product of:
3.7416575 = tf(freq=14.0), with freq of:
14.0 = termFreq=14.0
4.72992 = idf(docFreq=1060, maxDocs=44218)
0.046875 = fieldNorm(doc=1256)
0.5 = coord(1/2)
0.33333334 = coord(1/3)
- Abstract
- Most measures of networks are based on the nodes, although links are also elementary units in networks and represent interesting social or physical connections. In this work we suggest an option for exploring networks, called the h-strength, with explicit focus on links and their strengths. The h-strength and its extensions can naturally simplify a complex network to a small and concise subnetwork (h-subnet) but retains the most important links with its core structure. Its applications in 2 typical information networks, the paper cocitation network of a topic (the h-index) and 5 scientific collaboration networks in the field of "water resources," suggest that h-strength and its extensions could be a useful choice for abstracting, simplifying, and visualizing a complex network. Moreover, we observe that the 2 informetric models, the Glänzel-Schubert model and the Hirsch model, roughly hold in the context of the h-strength for the collaboration networks.
-
Zheng, R.; Li, J.; Chen, H.; Huang, Z.: ¬A framework for authorship identification of online messages : writing-style features and classification techniques (2006)
0.03
0.029997721 = product of:
0.089993164 = sum of:
0.089993164 = sum of:
0.05813029 = weight(_text_:networks in 5276) [ClassicSimilarity], result of:
0.05813029 = score(doc=5276,freq=2.0), product of:
0.22247115 = queryWeight, product of:
4.72992 = idf(docFreq=1060, maxDocs=44218)
0.047034867 = queryNorm
0.26129362 = fieldWeight in 5276, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.72992 = idf(docFreq=1060, maxDocs=44218)
0.0390625 = fieldNorm(doc=5276)
0.031862877 = weight(_text_:22 in 5276) [ClassicSimilarity], result of:
0.031862877 = score(doc=5276,freq=2.0), product of:
0.1647081 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.047034867 = queryNorm
0.19345059 = fieldWeight in 5276, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.0390625 = fieldNorm(doc=5276)
0.33333334 = coord(1/3)
- Abstract
- With the rapid proliferation of Internet technologies and applications, misuse of online messages for inappropriate or illegal purposes has become a major concern for society. The anonymous nature of online-message distribution makes identity tracing a critical problem. We developed a framework for authorship identification of online messages to address the identity-tracing problem. In this framework, four types of writing-style features (lexical, syntactic, structural, and content-specific features) are extracted and inductive learning algorithms are used to build feature-based classification models to identify authorship of online messages. To examine this framework, we conducted experiments on English and Chinese online-newsgroup messages. We compared the discriminating power of the four types of features and of three classification techniques: decision trees, backpropagation neural networks, and support vector machines. The experimental results showed that the proposed approach was able to identify authors of online messages with satisfactory accuracy of 70 to 95%. All four types of message features contributed to discriminating authors of online messages. Support vector machines outperformed the other two classification techniques in our experiments. The high performance we achieved for both the English and Chinese datasets showed the potential of this approach in a multiple-language context.
- Date
- 22. 7.2006 16:14:37
-
Xie, Z.; Ouyang, Z.; Li, J.; Dong, E.: Modelling transition phenomena of scientific coauthorship networks (2018)
0.02
0.020136926 = product of:
0.060410775 = sum of:
0.060410775 = product of:
0.12082155 = sum of:
0.12082155 = weight(_text_:networks in 4043) [ClassicSimilarity], result of:
0.12082155 = score(doc=4043,freq=6.0), product of:
0.22247115 = queryWeight, product of:
4.72992 = idf(docFreq=1060, maxDocs=44218)
0.047034867 = queryNorm
0.5430886 = fieldWeight in 4043, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
4.72992 = idf(docFreq=1060, maxDocs=44218)
0.046875 = fieldNorm(doc=4043)
0.5 = coord(1/2)
0.33333334 = coord(1/3)
- Abstract
- In a range of scientific coauthorship networks, transitions emerge in degree distribution, in the correlation between degree and local clustering coefficient, etc. The existence of those transitions could be regarded because of the diversity in collaboration behaviors of scientific fields. A growing geometric hypergraph built on a cluster of concentric circles is proposed to model two specific collaboration behaviors, namely the behaviors of research team leaders and those of the other team members. The model successfully predicts the transitions, as well as many common features of coauthorship networks. Particularly, it realizes a process of deriving the complex "scale-free" property from the simple "yes/no" decisions. Moreover, it provides a reasonable explanation for the emergence of transitions with the difference of collaboration behaviors between leaders and other members. The difference emerges in the evolution of research teams, which synthetically addresses several specific factors of generating collaborations, namely the communications between research teams, academic impacts and homophily of authors.
-
Li, J.; Willett, P.: ArticleRank : a PageRank-based alternative to numbers of citations for analysing citation networks (2009)
0.01
0.013701442 = product of:
0.041104324 = sum of:
0.041104324 = product of:
0.08220865 = sum of:
0.08220865 = weight(_text_:networks in 751) [ClassicSimilarity], result of:
0.08220865 = score(doc=751,freq=4.0), product of:
0.22247115 = queryWeight, product of:
4.72992 = idf(docFreq=1060, maxDocs=44218)
0.047034867 = queryNorm
0.369525 = fieldWeight in 751, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
4.72992 = idf(docFreq=1060, maxDocs=44218)
0.0390625 = fieldNorm(doc=751)
0.5 = coord(1/2)
0.33333334 = coord(1/3)
- Abstract
- Purpose - The purpose of this paper is to suggest an alternative to the widely used Times Cited criterion for analysing citation networks. The approach involves taking account of the natures of the papers that cite a given paper, so as to differentiate between papers that attract the same number of citations. Design/methodology/approach - ArticleRank is an algorithm that has been derived from Google's PageRank algorithm to measure the influence of journal articles. ArticleRank is applied to two datasets - a citation network based on an early paper on webometrics, and a self-citation network based on the 19 most cited papers in the Journal of Documentation - using citation data taken from the Web of Knowledge database. Findings - ArticleRank values provide a different ranking of a set of papers from that provided by the corresponding Times Cited values, and overcomes the inability of the latter to differentiate between papers with the same numbers of citations. The difference in rankings between Times Cited and ArticleRank is greatest for the most heavily cited articles in a dataset. Originality/value - This is a novel application of the PageRank algorithm.
-
Zhu, Q.; Kong, X.; Hong, S.; Li, J.; He, Z.: Global ontology research progress : a bibliometric analysis (2015)
0.01
0.0075101517 = product of:
0.022530455 = sum of:
0.022530455 = product of:
0.04506091 = sum of:
0.04506091 = weight(_text_:22 in 2590) [ClassicSimilarity], result of:
0.04506091 = score(doc=2590,freq=4.0), product of:
0.1647081 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.047034867 = queryNorm
0.27358043 = fieldWeight in 2590, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.0390625 = fieldNorm(doc=2590)
0.5 = coord(1/2)
0.33333334 = coord(1/3)
- Date
- 20. 1.2015 18:30:22
17. 9.2018 18:22:23
-
Lin, X.; Li, J.; Zhou, X.: Theme creation for digital collections (2008)
0.01
0.0074346713 = product of:
0.022304013 = sum of:
0.022304013 = product of:
0.044608027 = sum of:
0.044608027 = weight(_text_:22 in 2635) [ClassicSimilarity], result of:
0.044608027 = score(doc=2635,freq=2.0), product of:
0.1647081 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.047034867 = queryNorm
0.2708308 = fieldWeight in 2635, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.0546875 = fieldNorm(doc=2635)
0.5 = coord(1/2)
0.33333334 = coord(1/3)
- Source
- Metadata for semantic and social applications : proceedings of the International Conference on Dublin Core and Metadata Applications, Berlin, 22 - 26 September 2008, DC 2008: Berlin, Germany / ed. by Jane Greenberg and Wolfgang Klas
-
Li, J.; Shi, D.: Sleeping beauties in genius work : when were they awakened? (2016)
0.01
0.0063725756 = product of:
0.019117726 = sum of:
0.019117726 = product of:
0.038235452 = sum of:
0.038235452 = weight(_text_:22 in 2647) [ClassicSimilarity], result of:
0.038235452 = score(doc=2647,freq=2.0), product of:
0.1647081 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.047034867 = queryNorm
0.23214069 = fieldWeight in 2647, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.046875 = fieldNorm(doc=2647)
0.5 = coord(1/2)
0.33333334 = coord(1/3)
- Date
- 22. 1.2016 14:13:32
