Search (1544 results, page 1 of 78)

  • × year_i:[2000 TO 2010}
  1. Dempsey, L.: ¬The subject gateway : experiences and issues based on the emergence of the Resource Discovery Network (2000) 0.11 
    0.10601314 = product of:
  0.21202628 = sum of:
    0.21202628 = sum of:
      0.15624797 = weight(_text_:network in 628) [ClassicSimilarity], result of:
        0.15624797 = score(doc=628,freq=6.0), product of:
          0.22917621 = queryWeight, product of:
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.05146125 = queryNorm
          0.68178093 = fieldWeight in 628, product of:
            2.4494898 = tf(freq=6.0), with freq of:
              6.0 = termFreq=6.0
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.0625 = fieldNorm(doc=628)
      0.055778313 = weight(_text_:22 in 628) [ClassicSimilarity], result of:
        0.055778313 = score(doc=628,freq=2.0), product of:
          0.18020853 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.05146125 = queryNorm
          0.30952093 = fieldWeight in 628, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.0625 = fieldNorm(doc=628)
  0.5 = coord(1/2)
    Abstract
    Charts the history and development of the UK's Resource Discovery Network, which brings together under a common business, technical and service framework a range of subject gateways and other services for the academic and research community. Considers its future relationship to other services, and position within the information ecology
    Date
    22. 6.2002 19:36:13
    Object
    Resource Discovery Network
  2. Hotho, A.; Bloehdorn, S.: Data Mining 2004 : Text classification by boosting weak learners based on terms and concepts (2004) 0.10 
    0.10265097 = sum of:
  0.081734106 = product of:
    0.24520232 = sum of:
      0.24520232 = weight(_text_:3a in 562) [ClassicSimilarity], result of:
        0.24520232 = score(doc=562,freq=2.0), product of:
          0.43628904 = queryWeight, product of:
            8.478011 = idf(docFreq=24, maxDocs=44218)
            0.05146125 = queryNorm
          0.56201804 = fieldWeight in 562, 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=562)
    0.33333334 = coord(1/3)
  0.020916866 = product of:
    0.041833732 = sum of:
      0.041833732 = weight(_text_:22 in 562) [ClassicSimilarity], result of:
        0.041833732 = score(doc=562,freq=2.0), product of:
          0.18020853 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.05146125 = queryNorm
          0.23214069 = fieldWeight in 562, 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=562)
    0.5 = coord(1/2)
    Content
    Vgl.: http://www.google.de/url?sa=t&rct=j&q=&esrc=s&source=web&cd=1&cad=rja&ved=0CEAQFjAA&url=http%3A%2F%2Fciteseerx.ist.psu.edu%2Fviewdoc%2Fdownload%3Fdoi%3D10.1.1.91.4940%26rep%3Drep1%26type%3Dpdf&ei=dOXrUMeIDYHDtQahsIGACg&usg=AFQjCNHFWVh6gNPvnOrOS9R3rkrXCNVD-A&sig2=5I2F5evRfMnsttSgFF9g7Q&bvm=bv.1357316858,d.Yms.
    Date
    8. 1.2013 10:22:32
  3. Hu, D.; Kaza, S.; Chen, H.: Identifying significant facilitators of dark network evolution (2009) 0.08 
    0.08046674 = product of:
  0.16093348 = sum of:
    0.16093348 = sum of:
      0.12607203 = weight(_text_:network in 2753) [ClassicSimilarity], result of:
        0.12607203 = score(doc=2753,freq=10.0), product of:
          0.22917621 = queryWeight, product of:
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.05146125 = queryNorm
          0.5501096 = fieldWeight in 2753, product of:
            3.1622777 = tf(freq=10.0), with freq of:
              10.0 = termFreq=10.0
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.0390625 = fieldNorm(doc=2753)
      0.034861445 = weight(_text_:22 in 2753) [ClassicSimilarity], result of:
        0.034861445 = score(doc=2753,freq=2.0), product of:
          0.18020853 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.05146125 = queryNorm
          0.19345059 = fieldWeight in 2753, 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=2753)
  0.5 = coord(1/2)
    Abstract
    Social networks evolve over time with the addition and removal of nodes and links to survive and thrive in their environments. Previous studies have shown that the link-formation process in such networks is influenced by a set of facilitators. However, there have been few empirical evaluations to determine the important facilitators. In a research partnership with law enforcement agencies, we used dynamic social-network analysis methods to examine several plausible facilitators of co-offending relationships in a large-scale narcotics network consisting of individuals and vehicles. Multivariate Cox regression and a two-proportion z-test on cyclic and focal closures of the network showed that mutual acquaintance and vehicle affiliations were significant facilitators for the network under study. We also found that homophily with respect to age, race, and gender were not good predictors of future link formation in these networks. Moreover, we examined the social causes and policy implications for the significance and insignificance of various facilitators including common jails on future co-offending. These findings provide important insights into the link-formation processes and the resilience of social networks. In addition, they can be used to aid in the prediction of future links. The methods described can also help in understanding the driving forces behind the formation and evolution of social networks facilitated by mobile and Web technologies.
    Date
    22. 3.2009 18:50:30
  4. Campos, L.M. de; Fernández-Luna, J.M.; Huete, J.F.: Implementing relevance feedback in the Bayesian network retrieval model (2003) 0.08 
    0.07950986 = product of:
  0.15901972 = sum of:
    0.15901972 = sum of:
      0.11718599 = weight(_text_:network in 825) [ClassicSimilarity], result of:
        0.11718599 = score(doc=825,freq=6.0), product of:
          0.22917621 = queryWeight, product of:
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.05146125 = queryNorm
          0.51133573 = fieldWeight in 825, product of:
            2.4494898 = tf(freq=6.0), with freq of:
              6.0 = termFreq=6.0
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.046875 = fieldNorm(doc=825)
      0.041833732 = weight(_text_:22 in 825) [ClassicSimilarity], result of:
        0.041833732 = score(doc=825,freq=2.0), product of:
          0.18020853 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.05146125 = queryNorm
          0.23214069 = fieldWeight in 825, 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=825)
  0.5 = coord(1/2)
    Abstract
    Relevance Feedback consists in automatically formulating a new query according to the relevance judgments provided by the user after evaluating a set of retrieved documents. In this article, we introduce several relevance feedback methods for the Bayesian Network Retrieval ModeL The theoretical frame an which our methods are based uses the concept of partial evidences, which summarize the new pieces of information gathered after evaluating the results obtained by the original query. These partial evidences are inserted into the underlying Bayesian network and a new inference process (probabilities propagation) is run to compute the posterior relevance probabilities of the documents in the collection given the new query. The quality of the proposed methods is tested using a preliminary experimentation with different standard document collections.
    Date
    22. 3.2003 19:30:19
  5. Shibata, N.; Kajikawa, Y.; Takeda, Y.; Matsushima, K.: Comparative study on methods of detecting research fronts using different types of citation (2009) 0.07 
    0.07381185 = product of:
  0.1476237 = sum of:
    0.1476237 = sum of:
      0.11276226 = weight(_text_:network in 2743) [ClassicSimilarity], result of:
        0.11276226 = score(doc=2743,freq=8.0), product of:
          0.22917621 = queryWeight, product of:
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.05146125 = queryNorm
          0.492033 = fieldWeight in 2743, product of:
            2.828427 = tf(freq=8.0), with freq of:
              8.0 = termFreq=8.0
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.0390625 = fieldNorm(doc=2743)
      0.034861445 = weight(_text_:22 in 2743) [ClassicSimilarity], result of:
        0.034861445 = score(doc=2743,freq=2.0), product of:
          0.18020853 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.05146125 = queryNorm
          0.19345059 = fieldWeight in 2743, 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=2743)
  0.5 = coord(1/2)
    Abstract
    In this article, we performed a comparative study to investigate the performance of methods for detecting emerging research fronts. Three types of citation network, co-citation, bibliographic coupling, and direct citation, were tested in three research domains, gallium nitride (GaN), complex network (CNW), and carbon nanotube (CNT). Three types of citation network were constructed for each research domain, and the papers in those domains were divided into clusters to detect the research front. We evaluated the performance of each type of citation network in detecting a research front by using the following measures of papers in the cluster: visibility, measured by normalized cluster size, speed, measured by average publication year, and topological relevance, measured by density. Direct citation, which could detect large and young emerging clusters earlier, shows the best performance in detecting a research front, and co-citation shows the worst. Additionally, in direct citation networks, the clustering coefficient was the largest, which suggests that the content similarity of papers connected by direct citations is the greatest and that direct citation networks have the least risk of missing emerging research domains because core papers are included in the largest component.
    Date
    22. 3.2009 17:52:50
  6. Dabbadie, M.; Blancherie, J.M.: Alexandria, a multilingual dictionary for knowledge management purposes (2006) 0.07 
    0.06875784 = product of:
  0.13751568 = sum of:
    0.13751568 = sum of:
      0.09568194 = weight(_text_:network in 2465) [ClassicSimilarity], result of:
        0.09568194 = score(doc=2465,freq=4.0), product of:
          0.22917621 = queryWeight, product of:
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.05146125 = queryNorm
          0.41750383 = fieldWeight in 2465, product of:
            2.0 = tf(freq=4.0), with freq of:
              4.0 = termFreq=4.0
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.046875 = fieldNorm(doc=2465)
      0.041833732 = weight(_text_:22 in 2465) [ClassicSimilarity], result of:
        0.041833732 = score(doc=2465,freq=2.0), product of:
          0.18020853 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.05146125 = queryNorm
          0.23214069 = fieldWeight in 2465, 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=2465)
  0.5 = coord(1/2)
    Abstract
    Alexandria is an innovation of international impact. It is the only multilingual dictionary for websites and PCs. A double click on a word opens a small window that gives interactive translations between 22 languages and includes meaning, synonyms and associated expressions. It is an ASP application grounded on a semantic network that is portable on any operating system or platform. Behind the application is the Integral Dictionary is the semantic network created by Memodata. Alexandria can be customized with specific vocabulary, descriptive articles, images, sounds, videos, etc. Its domains of application are considerable: e-tourism, online medias, language learning, international websites. Alexandria has also proved to be a basic tool for knowledge management purposes. The application can be customized according to a user or an organization needs. An application dedicated to mobile devices is currently being developed. Future developments are planned in the field of e-tourism in relation with French "pôles de compétitivité".
  7. Sutton, S.A.; Golder, D.: Achievement Standards Network (ASN) : an application profile for mapping K-12 educational resources to achievement (2008) 0.07 
    0.06875784 = product of:
  0.13751568 = sum of:
    0.13751568 = sum of:
      0.09568194 = weight(_text_:network in 2636) [ClassicSimilarity], result of:
        0.09568194 = score(doc=2636,freq=4.0), product of:
          0.22917621 = queryWeight, product of:
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.05146125 = queryNorm
          0.41750383 = fieldWeight in 2636, product of:
            2.0 = tf(freq=4.0), with freq of:
              4.0 = termFreq=4.0
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.046875 = fieldNorm(doc=2636)
      0.041833732 = weight(_text_:22 in 2636) [ClassicSimilarity], result of:
        0.041833732 = score(doc=2636,freq=2.0), product of:
          0.18020853 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.05146125 = queryNorm
          0.23214069 = fieldWeight in 2636, 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=2636)
  0.5 = coord(1/2)
    Abstract
    This paper describes metadata development of an application profile for the National Science Digital Library (NSDL) Achievement Standards Network (ASN) in the United States. The ASN is a national repository of machine-readable achievement standards modeled in RDF that shape teaching and learning in the various states. We describe the nature of the ASN metadata and the various uses to which that metadata is applied including the alignment of the standards of one state to those of another and the correlation of those standards to educational resources in support of resource discovery and retrieval.
    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
  8. Zhang, Y.; Jansen, B.J.; Spink, A.: Identification of factors predicting clickthrough in Web searching using neural network analysis (2009) 0.07 
    0.06875784 = product of:
  0.13751568 = sum of:
    0.13751568 = sum of:
      0.09568194 = weight(_text_:network in 2742) [ClassicSimilarity], result of:
        0.09568194 = score(doc=2742,freq=4.0), product of:
          0.22917621 = queryWeight, product of:
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.05146125 = queryNorm
          0.41750383 = fieldWeight in 2742, product of:
            2.0 = tf(freq=4.0), with freq of:
              4.0 = termFreq=4.0
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.046875 = fieldNorm(doc=2742)
      0.041833732 = weight(_text_:22 in 2742) [ClassicSimilarity], result of:
        0.041833732 = score(doc=2742,freq=2.0), product of:
          0.18020853 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.05146125 = queryNorm
          0.23214069 = fieldWeight in 2742, 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=2742)
  0.5 = coord(1/2)
    Abstract
    In this research, we aim to identify factors that significantly affect the clickthrough of Web searchers. Our underlying goal is determine more efficient methods to optimize the clickthrough rate. We devise a clickthrough metric for measuring customer satisfaction of search engine results using the number of links visited, number of queries a user submits, and rank of clicked links. We use a neural network to detect the significant influence of searching characteristics on future user clickthrough. Our results show that high occurrences of query reformulation, lengthy searching duration, longer query length, and the higher ranking of prior clicked links correlate positively with future clickthrough. We provide recommendations for leveraging these findings for improving the performance of search engine retrieval and result ranking, along with implications for search engine marketing.
    Date
    22. 3.2009 17:49:11
  9. Su, F.P.; Lai, K.K.; Sharma, R.R.K.; Kuo, T.H.: Patent priority network : linking patent portfolio to strategic goals (2009) 0.07 
    0.06875784 = product of:
  0.13751568 = sum of:
    0.13751568 = sum of:
      0.09568194 = weight(_text_:network in 3170) [ClassicSimilarity], result of:
        0.09568194 = score(doc=3170,freq=4.0), product of:
          0.22917621 = queryWeight, product of:
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.05146125 = queryNorm
          0.41750383 = fieldWeight in 3170, product of:
            2.0 = tf(freq=4.0), with freq of:
              4.0 = termFreq=4.0
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.046875 = fieldNorm(doc=3170)
      0.041833732 = weight(_text_:22 in 3170) [ClassicSimilarity], result of:
        0.041833732 = score(doc=3170,freq=2.0), product of:
          0.18020853 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.05146125 = queryNorm
          0.23214069 = fieldWeight in 3170, 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=3170)
  0.5 = coord(1/2)
    Abstract
    When applying for patents, companies should consider performing patent portfolios as a means of integrating their patent strategy to shape their overall business strategy. This is an important issue for any company in pursuit of enhanced operational performance because the whole raison d'être behind the application of patents is the anticipation of achieving maximum competitive advantage. A prerequisite for such a company is a decision analysis model of patent portfolios because this has the added advantage of being readily applicable to the evaluation of the quality of its competitors' portfolios; thus, by understanding both itself and its competitors, a company can attain a superior position. To demonstrate this, we examine patent priority networks (PPNs) formed through patent family members and claimed priority patents, performing a model of patent portfolio analysis and then going on to determine the algorithms. We suggest that information retrieved from this network can provide a useful reference tool for decision-making by company CEOs, CTOs, R&D managers, and intellectual property managers.
    Date
    5.11.2009 20:35:22
  10. Price, A.: NOVAGate : a Nordic gateway to electronic resources in the forestry, veterinary and agricultural sciences (2000) 0.06 
    0.0638698 = product of:
  0.1277396 = sum of:
    0.1277396 = sum of:
      0.078933574 = weight(_text_:network in 4874) [ClassicSimilarity], result of:
        0.078933574 = score(doc=4874,freq=2.0), product of:
          0.22917621 = queryWeight, product of:
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.05146125 = queryNorm
          0.3444231 = fieldWeight in 4874, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.0546875 = fieldNorm(doc=4874)
      0.048806023 = weight(_text_:22 in 4874) [ClassicSimilarity], result of:
        0.048806023 = score(doc=4874,freq=2.0), product of:
          0.18020853 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.05146125 = queryNorm
          0.2708308 = fieldWeight in 4874, 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=4874)
  0.5 = coord(1/2)
    Abstract
    NOVAGate is a subject-based information gateway covering electronic resources in the agricultural, veterinary and related fields. The service, which opened in July 1998, is produced by the veterinary and agricultural libraries of the 5 Nordic countries - Denmark, Finland, Iceland, Norway and Sweden - which serve the NOVA University. The gateway covers Nordic and European resources as well as the resources of international organizations, but being planned is a network of subject gateways which will give access to a wide range of international quality resources within the agricultural, veterinary and related fields. The service uses the ROADS software
    Date
    22. 6.2002 19:41:00
  11. Mayr, P.; Petras, V.: Building a Terminology Network for Search : the KoMoHe project (2008) 0.06 
    0.0638698 = product of:
  0.1277396 = sum of:
    0.1277396 = sum of:
      0.078933574 = weight(_text_:network in 2618) [ClassicSimilarity], result of:
        0.078933574 = score(doc=2618,freq=2.0), product of:
          0.22917621 = queryWeight, product of:
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.05146125 = queryNorm
          0.3444231 = fieldWeight in 2618, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.0546875 = fieldNorm(doc=2618)
      0.048806023 = weight(_text_:22 in 2618) [ClassicSimilarity], result of:
        0.048806023 = score(doc=2618,freq=2.0), product of:
          0.18020853 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.05146125 = queryNorm
          0.2708308 = fieldWeight in 2618, 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=2618)
  0.5 = coord(1/2)
    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
  12. Chen, C.: CiteSpace II : detecting and visualizing emerging trends and transient patterns in scientific literature (2006) 0.06 
    0.057298202 = product of:
  0.114596404 = sum of:
    0.114596404 = sum of:
      0.07973496 = weight(_text_:network in 5272) [ClassicSimilarity], result of:
        0.07973496 = score(doc=5272,freq=4.0), product of:
          0.22917621 = queryWeight, product of:
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.05146125 = queryNorm
          0.34791988 = fieldWeight in 5272, product of:
            2.0 = tf(freq=4.0), with freq of:
              4.0 = termFreq=4.0
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.0390625 = fieldNorm(doc=5272)
      0.034861445 = weight(_text_:22 in 5272) [ClassicSimilarity], result of:
        0.034861445 = score(doc=5272,freq=2.0), product of:
          0.18020853 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.05146125 = queryNorm
          0.19345059 = fieldWeight in 5272, 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=5272)
  0.5 = coord(1/2)
    Abstract
    This article describes the latest development of a generic approach to detecting and visualizing emerging trends and transient patterns in scientific literature. The work makes substantial theoretical and methodological contributions to progressive knowledge domain visualization. A specialty is conceptualized and visualized as a time-variant duality between two fundamental concepts in information science: research fronts and intellectual bases. A research front is defined as an emergent and transient grouping of concepts and underlying research issues. The intellectual base of a research front is its citation and co-citation footprint in scientific literature - an evolving network of scientific publications cited by research-front concepts. Kleinberg's (2002) burst-detection algorithm is adapted to identify emergent research-front concepts. Freeman's (1979) betweenness centrality metric is used to highlight potential pivotal points of paradigm shift over time. Two complementary visualization views are designed and implemented: cluster views and time-zone views. The contributions of the approach are that (a) the nature of an intellectual base is algorithmically and temporally identified by emergent research-front terms, (b) the value of a co-citation cluster is explicitly interpreted in terms of research-front concepts, and (c) visually prominent and algorithmically detected pivotal points substantially reduce the complexity of a visualized network. The modeling and visualization process is implemented in CiteSpace II, a Java application, and applied to the analysis of two research fields: mass extinction (1981-2004) and terrorism (1990-2003). Prominent trends and pivotal points in visualized networks were verified in collaboration with domain experts, who are the authors of pivotal-point articles. Practical implications of the work are discussed. A number of challenges and opportunities for future studies are identified.
    Date
    22. 7.2006 16:11:05
  13. Furner, J.: ¬A unifying model of document relatedness for hybrid search engines (2003) 0.05 
    0.05474554 = product of:
  0.10949108 = sum of:
    0.10949108 = sum of:
      0.06765735 = weight(_text_:network in 2717) [ClassicSimilarity], result of:
        0.06765735 = score(doc=2717,freq=2.0), product of:
          0.22917621 = queryWeight, product of:
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.05146125 = queryNorm
          0.29521978 = fieldWeight in 2717, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.046875 = fieldNorm(doc=2717)
      0.041833732 = weight(_text_:22 in 2717) [ClassicSimilarity], result of:
        0.041833732 = score(doc=2717,freq=2.0), product of:
          0.18020853 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.05146125 = queryNorm
          0.23214069 = fieldWeight in 2717, 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=2717)
  0.5 = coord(1/2)
    Abstract
    Previous work an search-engine design has indicated that information-seekers may benefit from being given the opportunity to exploit multiple sources of evidence of document relatedness. Few existing systems, however, give users more than minimal control over the selections that may be made among methods of exploitation. By applying the methods of "document network analysis" (DNA), a unifying, graph-theoretic model of content-, collaboration-, and context-based systems (CCC) may be developed in which the nature of the similarities between types of document relatedness and document ranking are clarified. The usefulness of the approach to system design suggested by this model may be tested by constructing and evaluating a prototype system (UCXtra) that allows searchers to maintain control over the multiple ways in which document collections may be ranked and re-ranked.
    Date
    11. 9.2004 17:32:22
  14. Aringhieri, R.; Damiani, E.; De Capitani di Vimercati, S.; Paraboschi, S.; Samarati, P.: Fuzzy techniques for trust and reputation management in anonymous peer-to-peer systems (2006) 0.05 
    0.05474554 = product of:
  0.10949108 = sum of:
    0.10949108 = sum of:
      0.06765735 = weight(_text_:network in 5279) [ClassicSimilarity], result of:
        0.06765735 = score(doc=5279,freq=2.0), product of:
          0.22917621 = queryWeight, product of:
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.05146125 = queryNorm
          0.29521978 = fieldWeight in 5279, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.046875 = fieldNorm(doc=5279)
      0.041833732 = weight(_text_:22 in 5279) [ClassicSimilarity], result of:
        0.041833732 = score(doc=5279,freq=2.0), product of:
          0.18020853 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.05146125 = queryNorm
          0.23214069 = fieldWeight in 5279, 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=5279)
  0.5 = coord(1/2)
    Abstract
    Peer-to-peer (P2P) applications are rapidly gaining acceptance among users of Internet-based services, especially because of their capability of exchanging resources while preserving the anonymity of both requesters and providers. However, concerns have been raised about the possibility that malicious users can exploit the network to spread tampered-with resources (e.g., malicious programs and viruses). A considerable amount of research has thus focused on the development of trust and reputation models in P2P networks. In this article, we propose to use fuzzy techniques in the design of reputation systems based on collecting and aggregating peers' opinions. Fuzzy techniques are used in the evaluation and synthesis of all the opinions expressed by peers. The behavior of the proposed system is described by comparison with probabilistic approaches.
    Date
    22. 7.2006 17:06:18
  15. Ma, N.; Guan, J.; Zhao, Y.: Bringing PageRank to the citation analysis (2008) 0.05 
    0.05474554 = product of:
  0.10949108 = sum of:
    0.10949108 = sum of:
      0.06765735 = weight(_text_:network in 2064) [ClassicSimilarity], result of:
        0.06765735 = score(doc=2064,freq=2.0), product of:
          0.22917621 = queryWeight, product of:
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.05146125 = queryNorm
          0.29521978 = fieldWeight in 2064, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.046875 = fieldNorm(doc=2064)
      0.041833732 = weight(_text_:22 in 2064) [ClassicSimilarity], result of:
        0.041833732 = score(doc=2064,freq=2.0), product of:
          0.18020853 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.05146125 = queryNorm
          0.23214069 = fieldWeight in 2064, 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=2064)
  0.5 = coord(1/2)
    Abstract
    The paper attempts to provide an alternative method for measuring the importance of scientific papers based on the Google's PageRank. The method is a meaningful extension of the common integer counting of citations and is then experimented for bringing PageRank to the citation analysis in a large citation network. It offers a more integrated picture of the publications' influence in a specific field. We firstly calculate the PageRanks of scientific papers. The distributional characteristics and comparison with the traditionally used number of citations are then analyzed in detail. Furthermore, the PageRank is implemented in the evaluation of research influence for several countries in the field of Biochemistry and Molecular Biology during the time period of 2000-2005. Finally, some advantages of bringing PageRank to the citation analysis are concluded.
    Date
    31. 7.2008 14:22:05
  16. Woldering, B.: Europeana - mehrsprachiger Zugang zu Europas digitalem Kulturerbe (2008) 0.05 
    0.05474554 = product of:
  0.10949108 = sum of:
    0.10949108 = sum of:
      0.06765735 = weight(_text_:network in 2199) [ClassicSimilarity], result of:
        0.06765735 = score(doc=2199,freq=2.0), product of:
          0.22917621 = queryWeight, product of:
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.05146125 = queryNorm
          0.29521978 = fieldWeight in 2199, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.046875 = fieldNorm(doc=2199)
      0.041833732 = weight(_text_:22 in 2199) [ClassicSimilarity], result of:
        0.041833732 = score(doc=2199,freq=2.0), product of:
          0.18020853 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.05146125 = queryNorm
          0.23214069 = fieldWeight in 2199, 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=2199)
  0.5 = coord(1/2)
    Abstract
    The Europeana, the European digital library web-service, is being developed in the framework of the EU-funded network EDLnet. The demo version of this webservice was shown at an international conference at the German National Library in Frankfurt on 1 February 2008, the prototype will be launched in November 2008. In November 2007 the EDL Foundation was established to provide cross-domain multilingual access to Europe's cultural heritage. It will facilitate formal agreement across museums, archives, audio-visual archives and libraries on how to cooperate in the delivery and sustainability of a joint portal and will provide a legal framework for use by the EU for funding purposes and as a springboard for future governance. The European Commission is supporting the process towards the Europeana with a set of projects centering on The European Library. This webservice created by the European national libraries is seen as one of the major building blocks of the Europeana.
    Date
    22. 2.2009 19:11:35
  17. Schrodt, R.: Tiefen und Untiefen im wissenschaftlichen Sprachgebrauch (2008) 0.05 
    0.054489404 = product of:
  0.10897881 = sum of:
    0.10897881 = product of:
      0.32693642 = sum of:
        0.32693642 = weight(_text_:3a in 140) [ClassicSimilarity], result of:
          0.32693642 = score(doc=140,freq=2.0), product of:
            0.43628904 = queryWeight, product of:
              8.478011 = idf(docFreq=24, maxDocs=44218)
              0.05146125 = queryNorm
            0.7493574 = fieldWeight in 140, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              8.478011 = idf(docFreq=24, maxDocs=44218)
              0.0625 = fieldNorm(doc=140)
      0.33333334 = coord(1/3)
  0.5 = coord(1/2)
    Content
    Vgl. auch: https://studylibde.com/doc/13053640/richard-schrodt. Vgl. auch: http%3A%2F%2Fwww.univie.ac.at%2FGermanistik%2Fschrodt%2Fvorlesung%2Fwissenschaftssprache.doc&usg=AOvVaw1lDLDR6NFf1W0-oC9mEUJf.
  18. Pahor, M.; Scaronkerlavaj, M.; Dimovski, V.: Evidence for the network perspective on organizational learning (2008) 0.05 
    0.048336748 = product of:
  0.096673496 = sum of:
    0.096673496 = product of:
      0.19334699 = sum of:
        0.19334699 = weight(_text_:network in 2370) [ClassicSimilarity], result of:
          0.19334699 = score(doc=2370,freq=12.0), product of:
            0.22917621 = queryWeight, product of:
              4.4533744 = idf(docFreq=1398, maxDocs=44218)
              0.05146125 = queryNorm
            0.84366083 = fieldWeight in 2370, product of:
              3.4641016 = tf(freq=12.0), with freq of:
                12.0 = termFreq=12.0
              4.4533744 = idf(docFreq=1398, maxDocs=44218)
              0.0546875 = fieldNorm(doc=2370)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Abstract
    This article provides evidence for the network perspective on organizational learning in the cases of two companies of different size, industry, and culture. It builds on an earlier article that introduced the network perspective on organizational learning, and proposes some common traits of learning networks and tests them with the help of the tools of social-network analysis. We find support for the network perspective on organizational learning. There are some traits of the learning network that are common to very different companies, such as the fact that learning occurs mainly in clusters. Some other traits depend much on the organizational culture.
  19. Yan, E.; Ding, Y.: Applying centrality measures to impact analysis : a coauthorship network analysis (2009) 0.05 
    0.048336748 = product of:
  0.096673496 = sum of:
    0.096673496 = product of:
      0.19334699 = sum of:
        0.19334699 = weight(_text_:network in 3083) [ClassicSimilarity], result of:
          0.19334699 = score(doc=3083,freq=12.0), product of:
            0.22917621 = queryWeight, product of:
              4.4533744 = idf(docFreq=1398, maxDocs=44218)
              0.05146125 = queryNorm
            0.84366083 = fieldWeight in 3083, product of:
              3.4641016 = tf(freq=12.0), with freq of:
                12.0 = termFreq=12.0
              4.4533744 = idf(docFreq=1398, maxDocs=44218)
              0.0546875 = fieldNorm(doc=3083)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Abstract
    Many studies on coauthorship networks focus on network topology and network statistical mechanics. This article takes a different approach by studying micro-level network properties with the aim of applying centrality measures to impact analysis. Using coauthorship data from 16 journals in the field of library and information science (LIS) with a time span of 20 years (1988-2007), we construct an evolving coauthorship network and calculate four centrality measures (closeness centrality, betweenness centrality, degree centrality, and PageRank) for authors in this network. We find that the four centrality measures are significantly correlated with citation counts. We also discuss the usability of centrality measures in author ranking and suggest that centrality measures can be useful indicators for impact analysis.
  20. Savolainen, R.: Network competence and information seeking on the Internet : from definitions towards a social cognitive model (2002) 0.05 
    0.04784097 = product of:
  0.09568194 = sum of:
    0.09568194 = product of:
      0.19136389 = sum of:
        0.19136389 = weight(_text_:network in 4467) [ClassicSimilarity], result of:
          0.19136389 = score(doc=4467,freq=16.0), product of:
            0.22917621 = queryWeight, product of:
              4.4533744 = idf(docFreq=1398, maxDocs=44218)
              0.05146125 = queryNorm
            0.83500767 = fieldWeight in 4467, product of:
              4.0 = tf(freq=16.0), with freq of:
                16.0 = termFreq=16.0
              4.4533744 = idf(docFreq=1398, maxDocs=44218)
              0.046875 = fieldNorm(doc=4467)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Abstract
    The author reflects the conceptual and practical questions of network competence in the context of information seeking. Network competence is seen as one of the information-related competences and is defined as the mastery of four major areas: knowledge of information resources available on the Internet, skilled use of the ICT tools to access information, judgment of the relevance of information, and communication. Drawing on the ideas of the social cognitive theory developed by Albert Bandura, a model of network competence is introduced in order to discuss network competence "in action". In the model, network competence is put in practical context by relating five major factors: network competence, self-efficacy, outcome expectations, affective factors such as anxiety, and experiences received from information seeking on the Internet. Particular attention is devoted to the connections between network competence and self-efficacy which denote a person's judgment of his or her ability to organize and execute action, such as finding information on the Web.

Authors

Languages

Types

  • a 1299
  • m 165
  • el 79
  • s 60
  • b 26
  • x 16
  • i 9
  • n 3
  • r 1
  • More… Less…

Themes

Subjects

Classifications