Search (746 results, page 1 of 38)

0.13530259 = product of:
  0.33825645 = sum of:
    0.24246866 = weight(_text_:3a in 400) [ClassicSimilarity], result of:
      0.24246866 = score(doc=400,freq=2.0), product of:
        0.43142503 = queryWeight, product of:
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.05088753 = queryNorm
        0.56201804 = fieldWeight in 400, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.046875 = fieldNorm(doc=400)
    0.0957878 = weight(_text_:link in 400) [ClassicSimilarity], result of:
      0.0957878 = score(doc=400,freq=2.0), product of:
        0.2711644 = queryWeight, product of:
          5.3287 = idf(docFreq=582, maxDocs=44218)
          0.05088753 = queryNorm
        0.35324624 = fieldWeight in 400, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.3287 = idf(docFreq=582, maxDocs=44218)
          0.046875 = fieldNorm(doc=400)
  0.4 = coord(2/5)

Abstract

On a scientific concept hierarchy, a parent concept may have a few attributes, each of which has multiple values being a group of child concepts. We call these attributes facets: classification has a few facets such as application (e.g., face recognition), model (e.g., svm, knn), and metric (e.g., precision). In this work, we aim at building faceted concept hierarchies from scientific literature. Hierarchy construction methods heavily rely on hypernym detection, however, the faceted relations are parent-to-child links but the hypernym relation is a multi-hop, i.e., ancestor-to-descendent link with a specific facet "type-of". We use information extraction techniques to find synonyms, sibling concepts, and ancestor-descendent relations from a data science corpus. And we propose a hierarchy growth algorithm to infer the parent-child links from the three types of relationships. It resolves conflicts by maintaining the acyclic structure of a hierarchy.

Content

Vgl.: https%3A%2F%2Faclanthology.org%2FD19-5317.pdf&usg=AOvVaw0ZZFyq5wWTtNTvNkrvjlGA.

0.09698746 = product of:
  0.4849373 = sum of:
    0.4849373 = weight(_text_:3a in 973) [ClassicSimilarity], result of:
      0.4849373 = score(doc=973,freq=2.0), product of:
        0.43142503 = queryWeight, product of:
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.05088753 = queryNorm
        1.1240361 = fieldWeight in 973, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.09375 = fieldNorm(doc=973)
  0.2 = coord(1/5)

Content

Vgl.: http%3A%2F%2Fcreativechoice.org%2Fdoc%2FHansJonas.pdf&usg=AOvVaw1TM3teaYKgABL5H9yoIifA&opi=89978449.

0.080822885 = product of:
  0.40411443 = sum of:
    0.40411443 = weight(_text_:3a in 1826) [ClassicSimilarity], result of:
      0.40411443 = score(doc=1826,freq=2.0), product of:
        0.43142503 = queryWeight, product of:
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.05088753 = queryNorm
        0.93669677 = fieldWeight in 1826, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.078125 = fieldNorm(doc=1826)
  0.2 = coord(1/5)

Source

http://www.google.de/url?sa=t&rct=j&q=&esrc=s&source=web&cd=5&ved=0CDQQFjAE&url=http%3A%2F%2Fdigbib.ubka.uni-karlsruhe.de%2Fvolltexte%2Fdocuments%2F3131107&ei=HzFWVYvGMsiNsgGTyoFI&usg=AFQjCNE2FHUeR9oQTQlNC4TPedv4Mo3DaQ&sig2=Rlzpr7a3BLZZkqZCXXN_IA&bvm=bv.93564037,d.bGg&cad=rja

0.058943924 = product of:
  0.1473598 = sum of:
    0.11288701 = weight(_text_:link in 57) [ClassicSimilarity], result of:
      0.11288701 = score(doc=57,freq=4.0), product of:
        0.2711644 = queryWeight, product of:
          5.3287 = idf(docFreq=582, maxDocs=44218)
          0.05088753 = queryNorm
        0.4163047 = fieldWeight in 57, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          5.3287 = idf(docFreq=582, maxDocs=44218)
          0.0390625 = fieldNorm(doc=57)
    0.03447279 = weight(_text_:22 in 57) [ClassicSimilarity], result of:
      0.03447279 = score(doc=57,freq=2.0), product of:
        0.17819946 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.05088753 = queryNorm
        0.19345059 = fieldWeight in 57, 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=57)
  0.4 = coord(2/5)

Abstract

Webometric network analyses have been used to map the connectivity of groups of websites to identify clusters, important sites or overall structure. Such analyses have mainly been based upon hyperlink counts, the number of hyperlinks between a pair of websites, although some have used title mentions or URL citations instead. The ability to automatically gather hyperlink counts from Yahoo! ceased in April 2011 and the ability to manually gather such counts was due to cease by early 2012, creating a need for alternatives. This article assesses URL citations and title mentions as possible replacements for hyperlinks in both binary and weighted direct link and co-inlink network diagrams. It also assesses three different types of data for the network connections: hit count estimates, counts of matching URLs, and filtered counts of matching URLs. Results from analyses of U.S. library and information science departments and U.K. universities give evidence that metrics based upon URLs or titles can be appropriate replacements for metrics based upon hyperlinks for both binary and weighted networks, although filtered counts of matching URLs are necessary to give the best results for co-title mention and co-URL citation network diagrams.

Date

6. 4.2012 18:16:22

0.05756131 = product of:
  0.28780654 = sum of:
    0.28780654 = weight(_text_:link in 4256) [ClassicSimilarity], result of:
      0.28780654 = score(doc=4256,freq=26.0), product of:
        0.2711644 = queryWeight, product of:
          5.3287 = idf(docFreq=582, maxDocs=44218)
          0.05088753 = queryNorm
        1.0613729 = fieldWeight in 4256, product of:
          5.0990195 = tf(freq=26.0), with freq of:
            26.0 = termFreq=26.0
          5.3287 = idf(docFreq=582, maxDocs=44218)
          0.0390625 = fieldNorm(doc=4256)
  0.2 = coord(1/5)

Abstract

Numerous web co-link studies have analyzed a wide variety of websites ranging from those in the academic and business arena to those dealing with politics and governments. Such studies uncover rich information about these organizations. In recent years, however, there has been a dearth of co-link analysis, mainly due to the lack of sources from which co-link data can be collected directly. Although several commercial services such as Alexa provide inlink data, none provide co-link data. We propose a new approach to web co-link analysis that can alleviate this problem so that researchers can continue to mine the valuable information contained in co-link data. The proposed approach has two components: (a) generating co-link data from inlink data using a computer program; (b) analyzing co-link data at the site level in addition to the page level that previous co-link analyses have used. The site-level analysis has the potential of expanding co-link data sources. We tested this proposed approach by analyzing a group of websites focused on vaccination using Moz inlink data. We found that the approach is feasible, as we were able to generate co-link data from inlink data and analyze the co-link data with multidimensional scaling.

0.05657602 = product of:
  0.2828801 = sum of:
    0.2828801 = weight(_text_:3a in 5955) [ClassicSimilarity], result of:
      0.2828801 = score(doc=5955,freq=2.0), product of:
        0.43142503 = queryWeight, product of:
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.05088753 = queryNorm
        0.65568775 = fieldWeight in 5955, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.0546875 = fieldNorm(doc=5955)
  0.2 = coord(1/5)

Footnote

Rez. in: Philosophisch-ethische Rezensionen vom 09.11.2019 (Jürgen Czogalla), Unter: https://philosophisch-ethische-rezensionen.de/rezension/Goedert1.html. In: B.I.T. online 23(2020) H.3, S.345-347 (W. Sühl-Strohmenger) [Unter: https%3A%2F%2Fwww.b-i-t-online.de%2Fheft%2F2020-03-rezensionen.pdf&usg=AOvVaw0iY3f_zNcvEjeZ6inHVnOK]. In: Open Password Nr. 805 vom 14.08.2020 (H.-C. Hobohm) [Unter: https://www.password-online.de/?mailpoet_router&endpoint=view_in_browser&action=view&data=WzE0MywiOGI3NjZkZmNkZjQ1IiwwLDAsMTMxLDFd].

0.05486206 = product of:
  0.13715515 = sum of:
    0.0957878 = weight(_text_:link in 3266) [ClassicSimilarity], result of:
      0.0957878 = score(doc=3266,freq=2.0), product of:
        0.2711644 = queryWeight, product of:
          5.3287 = idf(docFreq=582, maxDocs=44218)
          0.05088753 = queryNorm
        0.35324624 = fieldWeight in 3266, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.3287 = idf(docFreq=582, maxDocs=44218)
          0.046875 = fieldNorm(doc=3266)
    0.041367345 = weight(_text_:22 in 3266) [ClassicSimilarity], result of:
      0.041367345 = score(doc=3266,freq=2.0), product of:
        0.17819946 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.05088753 = queryNorm
        0.23214069 = fieldWeight in 3266, 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=3266)
  0.4 = coord(2/5)

Abstract

Entity disambiguation is a fundamental task of semantic Web annotation. Entity Linking (EL) is an essential procedure in entity disambiguation, which aims to link a mention appearing in a plain text to a structured or semi-structured knowledge base, such as Wikipedia. Existing research on EL usually annotates the mentions in a text one by one and treats entities independent to each other. However this might not be true in many application scenarios. For example, if two mentions appear in one text, they are likely to have certain intrinsic relationships. In this paper, we first propose a novel query expansion method for candidate generation utilizing the information of co-occurrences of mentions. We further propose a re-ranking model which can be iteratively adjusted based on the prediction in the previous round. Experiments on real-world data demonstrate the effectiveness of our proposed methods for entity disambiguation.

Date

24.10.2016 19:22:54

0.051430024 = product of:
  0.12857506 = sum of:
    0.079823166 = weight(_text_:link in 1534) [ClassicSimilarity], result of:
      0.079823166 = score(doc=1534,freq=2.0), product of:
        0.2711644 = queryWeight, product of:
          5.3287 = idf(docFreq=582, maxDocs=44218)
          0.05088753 = queryNorm
        0.29437187 = fieldWeight in 1534, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.3287 = idf(docFreq=582, maxDocs=44218)
          0.0390625 = fieldNorm(doc=1534)
    0.048751883 = weight(_text_:22 in 1534) [ClassicSimilarity], result of:
      0.048751883 = score(doc=1534,freq=4.0), product of:
        0.17819946 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.05088753 = queryNorm
        0.27358043 = fieldWeight in 1534, 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=1534)
  0.4 = coord(2/5)

Abstract

This paper uncovers patterns of knowledge dissemination among scientific disciplines. Although the transfer of knowledge is largely unobservable, citations from one discipline to another have been proven to be an effective proxy to study disciplinary knowledge flow. This study constructs a knowledge-flow network in which a node represents a Journal Citation Reports subject category and a link denotes the citations from one subject category to another. Using the concept of shortest path, several quantitative measurements are proposed and applied to a knowledge-flow network. Based on an examination of subject categories in Journal Citation Reports, this study indicates that social science domains tend to be more self-contained, so it is more difficult for knowledge from other domains to flow into them; at the same time, knowledge from science domains, such as biomedicine-, chemistry-, and physics-related domains, can access and be accessed by other domains more easily. This study also shows that social science domains are more disunified than science domains, because three fifths of the knowledge paths from one social science domain to another require at least one science domain to serve as an intermediate. This work contributes to discussions on disciplinarity and interdisciplinarity by providing empirical analysis.

Date

26.10.2014 20:22:22

0.04849373 = product of:
  0.24246866 = sum of:
    0.24246866 = weight(_text_:3a in 484) [ClassicSimilarity], result of:
      0.24246866 = score(doc=484,freq=2.0), product of:
        0.43142503 = queryWeight, product of:
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.05088753 = queryNorm
        0.56201804 = fieldWeight in 484, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.046875 = fieldNorm(doc=484)
  0.2 = coord(1/5)

Footnote

https%3A%2F%2Fjournals.univie.ac.at%2Findex.php%2Fvoebm%2Farticle%2Fdownload%2F5332%2F5271%2F&usg=AOvVaw2yQdFGHlmOwVls7ANCpTii.

0.0478939 = product of:
  0.2394695 = sum of:
    0.2394695 = weight(_text_:link in 4533) [ClassicSimilarity], result of:
      0.2394695 = score(doc=4533,freq=18.0), product of:
        0.2711644 = queryWeight, product of:
          5.3287 = idf(docFreq=582, maxDocs=44218)
          0.05088753 = queryNorm
        0.8831156 = fieldWeight in 4533, product of:
          4.2426405 = tf(freq=18.0), with freq of:
            18.0 = termFreq=18.0
          5.3287 = idf(docFreq=582, maxDocs=44218)
          0.0390625 = fieldNorm(doc=4533)
  0.2 = coord(1/5)

Abstract

Purpose - Link analysis is an established topic within webometrics. It normally uses counts of links between sets of web sites or to sets of web sites. These link counts are derived from web crawlers or commercial search engines with the latter being the only alternative for some investigations. This paper compares link counts with URL citation counts in order to assess whether the latter could be a replacement for the former if the major search engines withdraw their advanced hyperlink search facilities. Design/methodology/approach - URL citation counts are compared with link counts for a variety of data sets used in previous webometric studies. Findings - The results show a high degree of correlation between the two but with URL citations being much less numerous, at least outside academia and business. Research limitations/implications - The results cover a small selection of 15 case studies and so the findings are only indicative. Significant differences between results indicate that the difference between link counts and URL citation counts will vary between webometric studies. Practical implications - Should link searches be withdrawn, then link analyses of less well linked non-academic, non-commercial sites would be seriously weakened, although citations based on e-mail addresses could help to make citations more numerous than links for some business and academic contexts. Originality/value - This is the first systematic study of the difference between link counts and URL citation counts in a variety of contexts and it shows that there are significant differences between the two.

0.045718383 = product of:
  0.11429596 = sum of:
    0.079823166 = weight(_text_:link in 1348) [ClassicSimilarity], result of:
      0.079823166 = score(doc=1348,freq=2.0), product of:
        0.2711644 = queryWeight, product of:
          5.3287 = idf(docFreq=582, maxDocs=44218)
          0.05088753 = queryNorm
        0.29437187 = fieldWeight in 1348, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.3287 = idf(docFreq=582, maxDocs=44218)
          0.0390625 = fieldNorm(doc=1348)
    0.03447279 = weight(_text_:22 in 1348) [ClassicSimilarity], result of:
      0.03447279 = score(doc=1348,freq=2.0), product of:
        0.17819946 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.05088753 = queryNorm
        0.19345059 = fieldWeight in 1348, 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=1348)
  0.4 = coord(2/5)

Abstract

This article reports the results of a study that examined relationships between primary emotions, secondary emotions, and mood in the online information search context. During the experiment, participants were asked to search Google to obtain information on the two given search tasks. Participants' primary emotions were inferred from analysis of their facial expressions, data on secondary emotions were obtained through participant interviews, and mood was measured using the Positive Affect Negative Affect Scale (PANAS; Watson, Clark, & Tellegen, 1988) prior, during, and after the search. The search process was represented by the collection of search actions, search performance, and search outcome quality variables. The findings suggest existence of direct relationships between primary emotions and search actions, which in turn imply the possibility of inferring emotions from search actions and vice versa. The link between secondary emotions and searchers' evaluative judgments, and lack of evidence of any relationships between secondary emotions and other search process variables, point to the strengths and weaknesses of self-reported emotion measures in understanding searchers' affective experiences. Our study did not find strong relationships between mood and search process and outcomes, indicating that while mood can have a limited effect on search activities, it is a relatively stable and long-lasting state that cannot be easily altered by the search experience and, in turn, cannot significantly affect the search. The article proposes a model of relationships between emotions, mood, and several facets of the search process. Directions for future work are also discussed.

Date

22. 8.2014 16:58:40

0.045718383 = product of:
  0.11429596 = sum of:
    0.079823166 = weight(_text_:link in 1781) [ClassicSimilarity], result of:
      0.079823166 = score(doc=1781,freq=2.0), product of:
        0.2711644 = queryWeight, product of:
          5.3287 = idf(docFreq=582, maxDocs=44218)
          0.05088753 = queryNorm
        0.29437187 = fieldWeight in 1781, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.3287 = idf(docFreq=582, maxDocs=44218)
          0.0390625 = fieldNorm(doc=1781)
    0.03447279 = weight(_text_:22 in 1781) [ClassicSimilarity], result of:
      0.03447279 = score(doc=1781,freq=2.0), product of:
        0.17819946 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.05088753 = queryNorm
        0.19345059 = fieldWeight in 1781, 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=1781)
  0.4 = coord(2/5)

Abstract

Purpose - The purpose of this paper is to examine the effect of the Helping Interdisciplinary Vocabulary Engineering (HIVE) system on the inter-indexer consistency of information professionals when assigning keywords to a scientific abstract. This study examined first, the inter-indexer consistency of potential HIVE users; second, the impact HIVE had on consistency; and third, challenges associated with using HIVE. Design/methodology/approach - A within-subjects quasi-experimental research design was used for this study. Data were collected using a task-scenario based questionnaire. Analysis was performed on consistency results using Hooper's and Rolling's inter-indexer consistency measures. A series of t-tests was used to judge the significance between consistency measure results. Findings - Results suggest that HIVE improves inter-indexing consistency. Working with HIVE increased consistency rates by 22 percent (Rolling's) and 25 percent (Hooper's) when selecting relevant terms from all vocabularies. A statistically significant difference exists between the assignment of free-text keywords and machine-aided keywords. Issues with homographs, disambiguation, vocabulary choice, and document structure were all identified as potential challenges. Research limitations/implications - Research limitations for this study can be found in the small number of vocabularies used for the study. Future research will include implementing HIVE into the Dryad Repository and studying its application in a repository system. Originality/value - This paper showcases several features used in HIVE system. By using traditional consistency measures to evaluate a semantic web technology, this paper emphasizes the link between traditional indexing and next generation machine-aided indexing (MAI) tools.

0.045718383 = product of:
  0.11429596 = sum of:
    0.079823166 = weight(_text_:link in 2376) [ClassicSimilarity], result of:
      0.079823166 = score(doc=2376,freq=2.0), product of:
        0.2711644 = queryWeight, product of:
          5.3287 = idf(docFreq=582, maxDocs=44218)
          0.05088753 = queryNorm
        0.29437187 = fieldWeight in 2376, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.3287 = idf(docFreq=582, maxDocs=44218)
          0.0390625 = fieldNorm(doc=2376)
    0.03447279 = weight(_text_:22 in 2376) [ClassicSimilarity], result of:
      0.03447279 = score(doc=2376,freq=2.0), product of:
        0.17819946 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.05088753 = queryNorm
        0.19345059 = fieldWeight in 2376, 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=2376)
  0.4 = coord(2/5)

Abstract

Knowledge organization is needed everywhere. Its importance is marked by its pervasiveness. This paper will show many areas, tasks, and functions where proper use of knowledge organization, construed as broadly as the term implies, provides support for learning and understanding, for sense making and meaning making, for inference, and for discovery by people and computer programs and thereby will make the world a better place. The paper focuses not on metadata but rather on structuring and representing the actual data or knowledge itself and argues for more communication between the largely separated KO, ontology, data modeling, and semantic web communities to address the many problems that need better solutions. In particular, the paper discusses the application of knowledge organization in knowledge bases for question answering and cognitive systems, knowledge bases for information extraction from text or multimedia, linked data, big data and data analytics, electronic health records as one example, influence diagrams (causal maps), dynamic system models, process diagrams, concept maps, and other node-link diagrams, information systems in organizations, knowledge organization for understanding and learning, and knowledge transfer between domains. The paper argues for moving beyond triples to a more powerful representation using entities and multi-way relationships but not attributes.

Date

27.11.2015 20:52:22

0.045154806 = product of:
  0.22577402 = sum of:
    0.22577402 = weight(_text_:link in 2358) [ClassicSimilarity], result of:
      0.22577402 = score(doc=2358,freq=4.0), product of:
        0.2711644 = queryWeight, product of:
          5.3287 = idf(docFreq=582, maxDocs=44218)
          0.05088753 = queryNorm
        0.8326094 = fieldWeight in 2358, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          5.3287 = idf(docFreq=582, maxDocs=44218)
          0.078125 = fieldNorm(doc=2358)
  0.2 = coord(1/5)

Source

https://www.heise.de/newsticker/meldung/Missing-Link-Wenn-der-Kasten-denkt-Niklas-Luhmann-und-die-Folgen-3919843.html

0.044700976 = product of:
  0.22350487 = sum of:
    0.22350487 = weight(_text_:link in 973) [ClassicSimilarity], result of:
      0.22350487 = score(doc=973,freq=8.0), product of:
        0.2711644 = queryWeight, product of:
          5.3287 = idf(docFreq=582, maxDocs=44218)
          0.05088753 = queryNorm
        0.8242412 = fieldWeight in 973, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          5.3287 = idf(docFreq=582, maxDocs=44218)
          0.0546875 = fieldNorm(doc=973)
  0.2 = coord(1/5)

Abstract

A network is constructed by nodes and links, thus the node degree and the link strength appear as underlying quantities in network analysis. While the power-law distribution of node degrees is verified as a basic feature of numerous real networks, we investigate whether the link strengths follow the power-law distribution in weighted networks. After testing 12 different paper cocitation networks with 2 methods, fitting in double-log scales and the Kolmogorov-Smirnov test (K-S test), we observe that, in most cases, the link strengths also follow the approximate power-law distribution. The results suggest that the power-law type distribution could emerge not only in nodes and informational entities, but also in links and informational connections.

0.040411443 = product of:
  0.20205721 = sum of:
    0.20205721 = weight(_text_:3a in 4997) [ClassicSimilarity], result of:
      0.20205721 = score(doc=4997,freq=2.0), product of:
        0.43142503 = queryWeight, product of:
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.05088753 = queryNorm
        0.46834838 = fieldWeight in 4997, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.0390625 = fieldNorm(doc=4997)
  0.2 = coord(1/5)

Content

PhD Dissertation at International Doctorate School in Information and Communication Technology. Vgl.: https%3A%2F%2Fcore.ac.uk%2Fdownload%2Fpdf%2F150083013.pdf&usg=AOvVaw2n-qisNagpyT0lli_6QbAQ.

0.040411443 = product of:
  0.20205721 = sum of:
    0.20205721 = weight(_text_:3a in 4388) [ClassicSimilarity], result of:
      0.20205721 = score(doc=4388,freq=2.0), product of:
        0.43142503 = queryWeight, product of:
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.05088753 = queryNorm
        0.46834838 = fieldWeight in 4388, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.0390625 = fieldNorm(doc=4388)
  0.2 = coord(1/5)

Footnote

Vgl. unter: https://www.google.de/url?sa=t&rct=j&q=&esrc=s&source=web&cd=2&cad=rja&uact=8&ved=2ahUKEwizweHljdbcAhVS16QKHXcFD9QQFjABegQICRAB&url=https%3A%2F%2Fwww.researchgate.net%2Fpublication%2F271200105_Die_Autonomie_des_Menschen_und_der_Maschine_-_gegenwartige_Definitionen_von_Autonomie_zwischen_philosophischem_Hintergrund_und_technologischer_Umsetzbarkeit_Redigierte_Version_der_Magisterarbeit_Karls&usg=AOvVaw06orrdJmFF2xbCCp_hL26q.

0.040411443 = product of:
  0.20205721 = sum of:
    0.20205721 = weight(_text_:3a in 855) [ClassicSimilarity], result of:
      0.20205721 = score(doc=855,freq=2.0), product of:
        0.43142503 = queryWeight, product of:
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.05088753 = queryNorm
        0.46834838 = fieldWeight in 855, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.0390625 = fieldNorm(doc=855)
  0.2 = coord(1/5)

Content

Vgl. auch: New automatic interpreter for complex UDC numbers. Unter: <https%3A%2F%2Fudcc.org%2Ffiles%2FAttilaPiros_EC_36-37_2014-2015.pdf&usg=AOvVaw3kc9CwDDCWP7aArpfjrs5b>

0.039105207 = product of:
  0.19552603 = sum of:
    0.19552603 = weight(_text_:link in 2706) [ClassicSimilarity], result of:
      0.19552603 = score(doc=2706,freq=12.0), product of:
        0.2711644 = queryWeight, product of:
          5.3287 = idf(docFreq=582, maxDocs=44218)
          0.05088753 = queryNorm
        0.7210609 = fieldWeight in 2706, product of:
          3.4641016 = tf(freq=12.0), with freq of:
            12.0 = termFreq=12.0
          5.3287 = idf(docFreq=582, maxDocs=44218)
          0.0390625 = fieldNorm(doc=2706)
  0.2 = coord(1/5)

Abstract

Transfer learning utilizes labeled data available from some related domain (source domain) for achieving effective knowledge transformation to the target domain. However, most state-of-the-art cross-domain classification methods treat documents as plain text and ignore the hyperlink (or citation) relationship existing among the documents. In this paper, we propose a novel cross-domain document classification approach called Link-Bridged Topic model (LBT). LBT consists of two key steps. Firstly, LBT utilizes an auxiliary link network to discover the direct or indirect co-citation relationship among documents by embedding the background knowledge into a graph kernel. The mined co-citation relationship is leveraged to bridge the gap across different domains. Secondly, LBT simultaneously combines the content information and link structures into a unified latent topic model. The model is based on an assumption that the documents of source and target domains share some common topics from the point of view of both content information and link structure. By mapping both domains data into the latent topic spaces, LBT encodes the knowledge about domain commonality and difference as the shared topics with associated differential probabilities. The learned latent topics must be consistent with the source and target data, as well as content and link statistics. Then the shared topics act as the bridge to facilitate knowledge transfer from the source to the target domains. Experiments on different types of datasets show that our algorithm significantly improves the generalization performance of cross-domain document classification.

0.03831512 = product of:
  0.1915756 = sum of:
    0.1915756 = weight(_text_:link in 4964) [ClassicSimilarity], result of:
      0.1915756 = score(doc=4964,freq=8.0), product of:
        0.2711644 = queryWeight, product of:
          5.3287 = idf(docFreq=582, maxDocs=44218)
          0.05088753 = queryNorm
        0.7064925 = fieldWeight in 4964, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          5.3287 = idf(docFreq=582, maxDocs=44218)
          0.046875 = fieldNorm(doc=4964)
  0.2 = coord(1/5)

Abstract

In this article, we build models to predict the existence of citations among papers by formulating link prediction for 5 large-scale datasets of citation networks. The supervised machine-learning model is applied with 11 features. As a result, our learner performs very well, with the F1 values of between 0.74 and 0.82. Three features in particular, link-based Jaccard coefficient difference in betweenness centrality, and cosine similarity of term frequency-inverse document frequency vectors, largely affect the predictions of citations. The results also indicate that different models are required for different types of research areas-research fields with a single issue or research fields with multiple issues. In the case of research fields with multiple issues, there are barriers among research fields because our results indicate that papers tend to be cited in each research field locally. Therefore, one must consider the typology of targeted research areas when building models for link prediction in citation networks.