Search (3 results, page 1 of 1)

0.022199241 = product of:
  0.088796966 = sum of:
    0.088796966 = product of:
      0.17759393 = sum of:
        0.17759393 = weight(_text_:project in 415) [ClassicSimilarity], result of:
          0.17759393 = score(doc=415,freq=18.0), product of:
            0.21156175 = queryWeight, product of:
              4.220981 = idf(docFreq=1764, maxDocs=44218)
              0.050121464 = queryNorm
            0.8394425 = fieldWeight in 415, product of:
              4.2426405 = tf(freq=18.0), with freq of:
                18.0 = termFreq=18.0
              4.220981 = idf(docFreq=1764, maxDocs=44218)
              0.046875 = fieldNorm(doc=415)
      0.5 = coord(1/2)
  0.25 = coord(1/4)

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.020432387 = product of:
  0.040864773 = sum of:
    0.021657582 = weight(_text_:library in 2654) [ClassicSimilarity], result of:
      0.021657582 = score(doc=2654,freq=4.0), product of:
        0.1317883 = queryWeight, product of:
          2.6293786 = idf(docFreq=8668, maxDocs=44218)
          0.050121464 = queryNorm
        0.16433616 = fieldWeight in 2654, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          2.6293786 = idf(docFreq=8668, maxDocs=44218)
          0.03125 = fieldNorm(doc=2654)
    0.019207189 = product of:
      0.038414378 = sum of:
        0.038414378 = weight(_text_:22 in 2654) [ClassicSimilarity], result of:
          0.038414378 = score(doc=2654,freq=4.0), product of:
            0.17551683 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.050121464 = queryNorm
            0.21886435 = fieldWeight in 2654, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.03125 = fieldNorm(doc=2654)
      0.5 = coord(1/2)
  0.5 = coord(2/4)

Abstract

In order to transfer the Chinese Classified Thesaurus (CCT) into a machine-processable format and provide CCT-based Web services, a pilot study has been conducted in which a variety of selected CCT classes and mapped thesaurus entries are encoded with SKOS. OWL and RDFS are also used to encode the same contents for the purposes of feasibility and cost-benefit comparison. CCT is a collected effort led by the National Library of China. It is an integration of the national standards Chinese Library Classification (CLC) 4th edition and Chinese Thesaurus (CT). As a manually created mapping product, CCT provides for each of the classes the corresponding thesaurus terms, and vice versa. The coverage of CCT includes four major clusters: philosophy, social sciences and humanities, natural sciences and technologies, and general works. There are 22 main-classes, 52,992 sub-classes and divisions, 110,837 preferred thesaurus terms, 35,690 entry terms (non-preferred terms), and 59,738 pre-coordinated headings (Chinese Classified Thesaurus, 2005) Major challenges of encoding this large vocabulary comes from its integrated structure. CCT is a result of the combination of two structures (illustrated in Figure 1): a thesaurus that uses ISO-2788 standardized structure and a classification scheme that is basically enumerative, but provides some flexibility for several kinds of synthetic mechanisms Other challenges include the complex relationships caused by differences of granularities of two original schemes and their presentation with various levels of SKOS elements; as well as the diverse coordination of entries due to the use of auxiliary tables and pre-coordinated headings derived from combining classes, subdivisions, and thesaurus terms, which do not correspond to existing unique identifiers. The poster reports the progress, shares the sample SKOS entries, and summarizes problems identified during the SKOS encoding process. Although OWL Lite and OWL Full provide richer expressiveness, the cost-benefit issues and the final purposes of encoding CCT raise questions of using such approaches.

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.005093075 = product of:
  0.0203723 = sum of:
    0.0203723 = product of:
      0.0407446 = sum of:
        0.0407446 = weight(_text_:22 in 2239) [ClassicSimilarity], result of:
          0.0407446 = score(doc=2239,freq=2.0), product of:
            0.17551683 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.050121464 = queryNorm
            0.23214069 = fieldWeight in 2239, 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=2239)
      0.5 = coord(1/2)
  0.25 = coord(1/4)

Date

31. 5.2004 19:22:06