Search (18 results, page 1 of 1)

0.028611436 = product of:
  0.042917155 = sum of:
    0.02263261 = weight(_text_:on in 2647) [ClassicSimilarity], result of:
      0.02263261 = score(doc=2647,freq=4.0), product of:
        0.109763056 = queryWeight, product of:
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.04990557 = queryNorm
        0.20619515 = fieldWeight in 2647, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.046875 = fieldNorm(doc=2647)
    0.020284547 = product of:
      0.040569093 = sum of:
        0.040569093 = weight(_text_:22 in 2647) [ClassicSimilarity], result of:
          0.040569093 = score(doc=2647,freq=2.0), product of:
            0.1747608 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.04990557 = 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.6666667 = coord(2/3)

Abstract

"Genius work," proposed by Avramescu, refers to scientific articles whose citations grow exponentially in an extended period, for example, over 50 years. Such articles were defined as "sleeping beauties" by van Raan, who quantitatively studied the phenomenon of delayed recognition. However, the criteria adopted by van Raan at times are not applicable and may confer recognition prematurely. To revise such deficiencies, this paper proposes two new criteria, which are applicable (but not limited) to exponential citation curves. We searched for genius work among articles of Nobel Prize laureates during the period of 1901-2012 on the Web of Science, finding 25 articles of genius work out of 21,438 papers including 10 (by van Raan's criteria) sleeping beauties and 15 nonsleeping-beauties. By our new criteria, two findings were obtained through empirical analysis: (a) the awakening periods for genius work depend on the increase rate b in the exponential function, and (b) lower b leads to a longer sleeping period.

Date

22. 1.2016 14:13:32

0.02822417 = product of:
  0.042336255 = sum of:
    0.01867095 = weight(_text_:on in 2635) [ClassicSimilarity], result of:
      0.01867095 = score(doc=2635,freq=2.0), product of:
        0.109763056 = queryWeight, product of:
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.04990557 = queryNorm
        0.17010231 = fieldWeight in 2635, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.0546875 = fieldNorm(doc=2635)
    0.023665305 = product of:
      0.04733061 = sum of:
        0.04733061 = weight(_text_:22 in 2635) [ClassicSimilarity], result of:
          0.04733061 = score(doc=2635,freq=2.0), product of:
            0.1747608 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.04990557 = 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.6666667 = coord(2/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

0.020160122 = product of:
  0.030240182 = sum of:
    0.013336393 = weight(_text_:on in 5276) [ClassicSimilarity], result of:
      0.013336393 = score(doc=5276,freq=2.0), product of:
        0.109763056 = queryWeight, product of:
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.04990557 = queryNorm
        0.121501654 = fieldWeight in 5276, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.0390625 = fieldNorm(doc=5276)
    0.01690379 = product of:
      0.03380758 = sum of:
        0.03380758 = weight(_text_:22 in 5276) [ClassicSimilarity], result of:
          0.03380758 = score(doc=5276,freq=2.0), product of:
            0.1747608 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.04990557 = 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.5 = coord(1/2)
  0.6666667 = coord(2/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

0.011928434 = product of:
  0.0357853 = sum of:
    0.0357853 = weight(_text_:on in 3296) [ClassicSimilarity], result of:
      0.0357853 = score(doc=3296,freq=10.0), product of:
        0.109763056 = queryWeight, product of:
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.04990557 = queryNorm
        0.32602316 = fieldWeight in 3296, product of:
          3.1622777 = tf(freq=10.0), with freq of:
            10.0 = termFreq=10.0
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.046875 = fieldNorm(doc=3296)
  0.33333334 = coord(1/3)

Abstract

User-generated content on the Web has become an extremely valuable source for mining and analyzing user opinions on any topic. Recent years have seen an increasing body of work investigating methods to recognize favorable and unfavorable sentiments toward specific subjects from online text. However, most of these efforts focus on English and there have been very few studies on sentiment analysis of Chinese content. This paper aims to address the unique challenges posed by Chinese sentiment analysis. We propose a rule-based approach including two phases: (1) determining each sentence's sentiment based on word dependency, and (2) aggregating sentences to predict the document sentiment. We report the results of an experimental study comparing our approach with three machine learning-based approaches using two sets of Chinese articles. These results illustrate the effectiveness of our proposed method and its advantages against learning-based approaches.

0.010669115 = product of:
  0.032007344 = sum of:
    0.032007344 = weight(_text_:on in 3961) [ClassicSimilarity], result of:
      0.032007344 = score(doc=3961,freq=8.0), product of:
        0.109763056 = queryWeight, product of:
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.04990557 = queryNorm
        0.29160398 = fieldWeight in 3961, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.046875 = fieldNorm(doc=3961)
  0.33333334 = coord(1/3)

Abstract

Modeling multidimensional relevance in information retrieval (IR) has attracted much attention in recent years. However, most existing studies are conducted through relatively small-scale user studies, which may not reflect a real-world and natural search scenario. In this article, we propose to study the multidimensional user relevance model (MURM) on large scale query logs, which record users' various search behaviors (e.g., query reformulations, clicks and dwelling time, etc.) in natural search settings. We advance an existing MURM model (including five dimensions: topicality, novelty, reliability, understandability, and scope) by providing two additional dimensions, that is, interest and habit. The two new dimensions represent personalized relevance judgment on retrieved documents. Further, for each dimension in the enriched MURM model, a set of computable features are formulated. By conducting extensive document ranking experiments on Bing's query logs and TREC session Track data, we systematically investigated the impact of each dimension on retrieval performance and gained a series of insightful findings which may bring benefits for the design of future IR systems.

0.010669115 = product of:
  0.032007344 = sum of:
    0.032007344 = weight(_text_:on in 415) [ClassicSimilarity], result of:
      0.032007344 = score(doc=415,freq=8.0), product of:
        0.109763056 = queryWeight, product of:
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.04990557 = queryNorm
        0.29160398 = fieldWeight in 415, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.046875 = fieldNorm(doc=415)
  0.33333334 = coord(1/3)

Abstract

Project success is critical in the crowdfunding domain. Rather than the existing project-centric prediction methods, we propose a novel backer-centric prediction method. We identify each backer's preferences based on their pledge history and calculate the cosine similarity between backer's preferences and the project as each backer's persuasibility. Finally, we aggregate all the backers' persuasibility to predict project success. To validate our method, we crawled data on 183,886 projects launched during or before December 2014 on Kickstarter, a crowdfunding website. We selected 4,922 backers with a total of 442,793 pledges to identify backers' preferences. The results show that a backer is more likely to be persuaded by a project that is more similar to the backer's preferences. Our findings not only demonstrate the efficacy of backers' pledge history for predicting crowdfunding project success but also verify that a backer-centric method can supplement the existing project-centric approaches. Our model and findings enable crowdfunding platform agencies, fund-seeking entrepreneurs, and investors to predict the success of a crowdfunding project.

0.009239726 = product of:
  0.027719175 = sum of:
    0.027719175 = weight(_text_:on in 1611) [ClassicSimilarity], result of:
      0.027719175 = score(doc=1611,freq=6.0), product of:
        0.109763056 = queryWeight, product of:
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.04990557 = queryNorm
        0.25253648 = fieldWeight in 1611, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.046875 = fieldNorm(doc=1611)
  0.33333334 = coord(1/3)

Abstract

Relation extraction is the process of scanning text for relationships between named entities. Recently, significant studies have focused on automatically extracting relations from biomedical corpora. Most existing biomedical relation extractors require manual creation of biomedical lexicons or parsing templates based on domain knowledge. In this study, we propose to use kernel-based learning methods to automatically extract biomedical relations from literature text. We develop a framework of kernel-based learning for biomedical relation extraction. In particular, we modified the standard tree kernel function by incorporating a trace kernel to capture richer contextual information. In our experiments on a biomedical corpus, we compare different kernel functions for biomedical relation detection and classification. The experimental results show that a tree kernel outperforms word and sequence kernels for relation detection, our trace-tree kernel outperforms the standard tree kernel, and a composite kernel outperforms individual kernels for relation extraction.

0.009239726 = product of:
  0.027719175 = sum of:
    0.027719175 = weight(_text_:on in 1256) [ClassicSimilarity], result of:
      0.027719175 = score(doc=1256,freq=6.0), product of:
        0.109763056 = queryWeight, product of:
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.04990557 = queryNorm
        0.25253648 = fieldWeight in 1256, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.046875 = fieldNorm(doc=1256)
  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.

0.009239726 = product of:
  0.027719175 = sum of:
    0.027719175 = weight(_text_:on in 3441) [ClassicSimilarity], result of:
      0.027719175 = score(doc=3441,freq=6.0), product of:
        0.109763056 = queryWeight, product of:
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.04990557 = queryNorm
        0.25253648 = fieldWeight in 3441, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.046875 = fieldNorm(doc=3441)
  0.33333334 = coord(1/3)

Abstract

In this article we describe another problem with journal impact factors by showing that one journal's impact factor is dependent on other journals' publication delays. The proposed theoretical model predicts a monotonically decreasing function of the impact factor as a function of publication delay, on condition that the citation curve of the journal is monotone increasing during the publication window used in the calculation of the journal impact factor; otherwise, this function has a reversed U shape. Our findings based on simulations are verified by examining three journals in the information sciences: the Journal of Informetrics, Scientometrics, and the Journal of the Association for Information Science and Technology.

0.008890929 = product of:
  0.026672786 = sum of:
    0.026672786 = weight(_text_:on in 5816) [ClassicSimilarity], result of:
      0.026672786 = score(doc=5816,freq=8.0), product of:
        0.109763056 = queryWeight, product of:
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.04990557 = queryNorm
        0.24300331 = fieldWeight in 5816, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.0390625 = fieldNorm(doc=5816)
  0.33333334 = coord(1/3)

Abstract

Millions of messages are produced on microblog platforms every day, leading to the pressing need for automatic identification of key points from the massive texts. To absorb salient content from the vast bulk of microblog posts, this article focuses on the task of microblog keyphrase extraction. In previous work, most efforts treat messages as independent documents and might suffer from the data sparsity problem exhibited in short and informal microblog posts. On the contrary, we propose to enrich contexts via exploiting conversations initialized by target posts and formed by their replies, which are generally centered around relevant topics to the target posts and therefore helpful for keyphrase identification. Concretely, we present a neural keyphrase extraction framework, which has 2 modules: a conversation context encoder and a keyphrase tagger. The conversation context encoder captures indicative representation from their conversation contexts and feeds the representation into the keyphrase tagger, and the keyphrase tagger extracts salient words from target posts. The 2 modules were trained jointly to optimize the conversation context encoding and keyphrase extraction processes. In the conversation context encoder, we leverage hierarchical structures to capture the word-level indicative representation and message-level indicative representation hierarchically. In both of the modules, we apply character-level representations, which enables the model to explore morphological features and deal with the out-of-vocabulary problem caused by the informal language style of microblog messages. Extensive comparison results on real-life data sets indicate that our model outperforms state-of-the-art models from previous studies.

0.007968523 = product of:
  0.023905568 = sum of:
    0.023905568 = product of:
      0.047811136 = sum of:
        0.047811136 = weight(_text_:22 in 2590) [ClassicSimilarity], result of:
          0.047811136 = score(doc=2590,freq=4.0), product of:
            0.1747608 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.04990557 = 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

0.0076997704 = product of:
  0.02309931 = sum of:
    0.02309931 = weight(_text_:on in 751) [ClassicSimilarity], result of:
      0.02309931 = score(doc=751,freq=6.0), product of:
        0.109763056 = queryWeight, product of:
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.04990557 = queryNorm
        0.21044704 = fieldWeight in 751, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.0390625 = fieldNorm(doc=751)
  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.

0.0075442037 = product of:
  0.02263261 = sum of:
    0.02263261 = weight(_text_:on in 2806) [ClassicSimilarity], result of:
      0.02263261 = score(doc=2806,freq=4.0), product of:
        0.109763056 = queryWeight, product of:
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.04990557 = queryNorm
        0.20619515 = fieldWeight in 2806, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.046875 = fieldNorm(doc=2806)
  0.33333334 = coord(1/3)

Abstract

External information plays an important role in group decision-making processes, yet research about external information support for Group Support Systems (GSS) has been lacking. In this study, we propose an approach to build a concept space to provide external concept support for GSS users. Built on a Web mining algorithm, the approach can mine a concept space from the Web and retrieve related concepts from the concept space based on users' comments in a real-time manner. We conduct two experiments to evaluate the quality of the proposed approach and the effectiveness of the external concept support provided by this approach. The experiment results indicate that the concept space mined from the Web contained qualified concepts to stimulate divergent thinking. The results also demonstrate that external concept support in GSS greatly enhanced group productivity for idea generation tasks.

0.0062868367 = product of:
  0.01886051 = sum of:
    0.01886051 = weight(_text_:on in 4445) [ClassicSimilarity], result of:
      0.01886051 = score(doc=4445,freq=4.0), product of:
        0.109763056 = queryWeight, product of:
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.04990557 = queryNorm
        0.1718293 = fieldWeight in 4445, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.0390625 = fieldNorm(doc=4445)
  0.33333334 = coord(1/3)

Abstract

Citations in scientific literature are important both for tracking the historical development of scientific ideas and for forecasting research trends. However, the diffusion mechanisms underlying the citation process remain poorly understood, despite the frequent and longstanding use of citation counts for assessment purposes within the scientific community. Here, we extend the study of citation dynamics to a more general diffusion process to understand how citation growth associates with different diffusion patterns. Using a classic diffusion model, we quantify and illustrate specific diffusion mechanisms which have been proven to exert a significant impact on the growth and decay of citation counts. Experiments reveal a positive relation between the "low p and low q" pattern and high scientific impact. A sharp citation peak produced by rapid change of citation counts, however, has a negative effect on future impact. In addition, we have suggested a simple indicator, saturation level, to roughly estimate an individual article's current stage in the life cycle and its potential to attract future attention. The proposed approach can also be extended to higher levels of aggregation (e.g., individual scientists, journals, institutions), providing further insights into the practice of scientific evaluation.

0.00622365 = product of:
  0.01867095 = sum of:
    0.01867095 = weight(_text_:on in 3374) [ClassicSimilarity], result of:
      0.01867095 = score(doc=3374,freq=2.0), product of:
        0.109763056 = queryWeight, product of:
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.04990557 = queryNorm
        0.17010231 = fieldWeight in 3374, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.0546875 = fieldNorm(doc=3374)
  0.33333334 = coord(1/3)

Abstract

Reports results of a study to analyze the nature of reference services and reference desk transactions. 2 reference librarians, one from South Alabama University, Biomedical Library and the other from the Shiffman Medical Library, Wayne State University, Michigan, recorded reference transactions while they staffed the reference desks at their respective institutions from May to October 1996. 2 types of data were collected; types of tools or sources used to provide answers to reference queries; and instruction provided, from the reference desk, on different types of application

0.0053345575 = product of:
  0.016003672 = sum of:
    0.016003672 = weight(_text_:on in 4043) [ClassicSimilarity], result of:
      0.016003672 = score(doc=4043,freq=2.0), product of:
        0.109763056 = queryWeight, product of:
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.04990557 = queryNorm
        0.14580199 = fieldWeight in 4043, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.046875 = fieldNorm(doc=4043)
  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.

0.0053345575 = product of:
  0.016003672 = sum of:
    0.016003672 = weight(_text_:on in 4575) [ClassicSimilarity], result of:
      0.016003672 = score(doc=4575,freq=2.0), product of:
        0.109763056 = queryWeight, product of:
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.04990557 = queryNorm
        0.14580199 = fieldWeight in 4575, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.046875 = fieldNorm(doc=4575)
  0.33333334 = coord(1/3)

Abstract

Negative caveats of application programming interfaces (APIs) are about "how not to use an API," which are often absent from the official API documentation. When these caveats are overlooked, programming errors may emerge from misusing APIs, leading to heavy discussions on Q&A websites like Stack Overflow. If the overlooked caveats could be mined from these discussions, they would be beneficial for programmers to avoid misuse of APIs. However, it is challenging because the discussions are informal, redundant, and diverse. For this, for example, we propose Disca, a novel approach for automatically Distilling desirable API negative caveats from unstructured Q&A discussions. Through sentence selection and prominent term clustering, Disca ensures that distilled caveats are context-independent, prominent, semantically diverse, and nonredundant. Quantitative evaluation in our experiments shows that the proposed Disca significantly outperforms four text-summarization techniques. We also show that the distilled API negative caveats could greatly augment API documentation through qualitative analysis.

0.0053345575 = product of:
  0.016003672 = sum of:
    0.016003672 = weight(_text_:on in 1202) [ClassicSimilarity], result of:
      0.016003672 = score(doc=1202,freq=2.0), product of:
        0.109763056 = queryWeight, product of:
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.04990557 = queryNorm
        0.14580199 = fieldWeight in 1202, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.046875 = fieldNorm(doc=1202)
  0.33333334 = coord(1/3)

Abstract

Collaboration across disciplines is a critical form of scientific collaboration to solve complex problems and make innovative contributions. This study focuses on the association between multidisciplinary collaboration measured by coauthorship in publications and the disruption of publications measured by the Disruption (D) index. We used authors' affiliations as a proxy of the disciplines to which they belong and categorized an article into multidisciplinary collaboration or monodisciplinary collaboration. The D index quantifies the extent to which a study disrupts its predecessors. We selected 13 journals that publish articles in six disciplines from the Microsoft Academic Graph (MAG) database and then constructed regression models with fixed effects and estimated the relationship between the variables. The findings show that articles with monodisciplinary collaboration are more disruptive than those with multidisciplinary collaboration. Furthermore, we uncovered the mechanism of how monodisciplinary collaboration disrupts science more than multidisciplinary collaboration by exploring the references of the sampled publications.