Search (5 results, page 1 of 1)

  • × author_ss:"Liu, Y."
  1. Liu, Y.: Precision One MediaSource : film/video locator on CD-ROM (1995) 0.01 
    0.00807052 = product of:
  0.056493636 = sum of:
    0.04022163 = weight(_text_:bibliographic in 7744) [ClassicSimilarity], result of:
      0.04022163 = score(doc=7744,freq=2.0), product of:
        0.11688946 = queryWeight, product of:
          3.893044 = idf(docFreq=2449, maxDocs=44218)
          0.03002521 = queryNorm
        0.34409973 = fieldWeight in 7744, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.893044 = idf(docFreq=2449, maxDocs=44218)
          0.0625 = fieldNorm(doc=7744)
    0.016272005 = product of:
      0.03254401 = sum of:
        0.03254401 = weight(_text_:22 in 7744) [ClassicSimilarity], result of:
          0.03254401 = score(doc=7744,freq=2.0), product of:
            0.10514317 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.03002521 = queryNorm
            0.30952093 = fieldWeight in 7744, 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=7744)
      0.5 = coord(1/2)
  0.14285715 = coord(2/14)
    Abstract
    Precision One MediaSource First Edition is the first film and video listing on CD-ROM containing bibliographic records and information about renatl sources. It was co-produced by the Brodart Co., Pennsylvania, and the Consortium of College and University Media Centres (CCUMC) and requires an IBM/campatible with hard disk, CD-ROM drive and DOS 3.3 or higher. MediaSource is intended for educational and business users and is of particular interest to public, school and academic libraries. Discusses installation, the interface and searching, data quality and documentation
    Date
    22. 6.1997 16:34:51
  2. Liu, Y.; Xu, S.; Blanchard, E.: ¬A local context-aware LDA model for topic modeling in a document network (2017) 0.00 
    0.004806533 = product of:
  0.03364573 = sum of:
    0.016822865 = weight(_text_:classification in 3642) [ClassicSimilarity], result of:
      0.016822865 = score(doc=3642,freq=2.0), product of:
        0.09562149 = queryWeight, product of:
          3.1847067 = idf(docFreq=4974, maxDocs=44218)
          0.03002521 = queryNorm
        0.17593184 = fieldWeight in 3642, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.1847067 = idf(docFreq=4974, maxDocs=44218)
          0.0390625 = fieldNorm(doc=3642)
    0.016822865 = weight(_text_:classification in 3642) [ClassicSimilarity], result of:
      0.016822865 = score(doc=3642,freq=2.0), product of:
        0.09562149 = queryWeight, product of:
          3.1847067 = idf(docFreq=4974, maxDocs=44218)
          0.03002521 = queryNorm
        0.17593184 = fieldWeight in 3642, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.1847067 = idf(docFreq=4974, maxDocs=44218)
          0.0390625 = fieldNorm(doc=3642)
  0.14285715 = coord(2/14)
    Abstract
    With the rapid development of the Internet and its applications, growing volumes of documents increasingly become interconnected to form large-scale document networks. Accordingly, topic modeling in a network of documents has been attracting continuous research attention. Most of the existing network-based topic models assume that topics in a document are influenced by its directly linked neighbouring documents in a document network and overlook the potential influence from indirectly linked ones. The existing work also has not carefully modeled variations of such influence among neighboring documents. Recognizing these modeling limitations, this paper introduces a novel Local Context-Aware LDA Model (LC-LDA), which is capable of observing a local context comprising a rich collection of documents that may directly or indirectly influence the topic distributions of a target document. The proposed model can also differentiate the respective influence of each document in the local context on the target document according to both structural and temporal relationships between the two documents. The proposed model is extensively evaluated through multiple document clustering and classification tasks conducted over several large-scale document sets. Evaluation results clearly and consistently demonstrate the effectiveness and superiority of the new model with respect to several state-of-the-art peer models.
  3. Liu, Y.; Li, W.; Huang, Z.; Fang, Q.: ¬A fast method based on multiple clustering for name disambiguation in bibliographic citations (2015) 0.00 
    0.002539374 = product of:
  0.035551235 = sum of:
    0.035551235 = weight(_text_:bibliographic in 1672) [ClassicSimilarity], result of:
      0.035551235 = score(doc=1672,freq=4.0), product of:
        0.11688946 = queryWeight, product of:
          3.893044 = idf(docFreq=2449, maxDocs=44218)
          0.03002521 = queryNorm
        0.30414405 = fieldWeight in 1672, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.893044 = idf(docFreq=2449, maxDocs=44218)
          0.0390625 = fieldNorm(doc=1672)
  0.071428575 = coord(1/14)
    Abstract
    Name ambiguity in the context of bibliographic citation affects the quality of services in digital libraries. Previous methods are not widely applied in practice because of their high computational complexity and their strong dependency on excessive attributes, such as institutional affiliation, research area, address, etc., which are difficult to obtain in practice. To solve this problem, we propose a novel coarse-to-fine framework for name disambiguation which sequentially employs 3 common and easily accessible attributes (i.e., coauthor name, article title, and publication venue). Our proposed framework is based on multiple clustering and consists of 3 steps: (a) clustering articles by coauthorship and obtaining rough clusters, that is fragments; (b) clustering fragments obtained in step 1 by title information and getting bigger fragments; (c) and clustering fragments obtained in step 2 by the latent relations among venues. Experimental results on a Digital Bibliography and Library Project (DBLP) data set show that our method outperforms the existing state-of-the-art methods by 2.4% to 22.7% on the average pairwise F1 score and is 10 to 100 times faster in terms of execution time.
  4. Liu, Y.; Rousseau, R.: Interestingness and the essence of citation : Thomas Reid and bibliographic description (2013) 0.00 
    0.0021547303 = product of:
  0.030166224 = sum of:
    0.030166224 = weight(_text_:bibliographic in 1764) [ClassicSimilarity], result of:
      0.030166224 = score(doc=1764,freq=2.0), product of:
        0.11688946 = queryWeight, product of:
          3.893044 = idf(docFreq=2449, maxDocs=44218)
          0.03002521 = queryNorm
        0.2580748 = fieldWeight in 1764, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.893044 = idf(docFreq=2449, maxDocs=44218)
          0.046875 = fieldNorm(doc=1764)
  0.071428575 = coord(1/14)
  5. Qin, C.; Liu, Y.; Mou, J.; Chen, J.: User adoption of a hybrid social tagging approach in an online knowledge community (2019) 0.00 
    7.264289E-4 = product of:
  0.010170003 = sum of:
    0.010170003 = product of:
      0.020340007 = sum of:
        0.020340007 = weight(_text_:22 in 5492) [ClassicSimilarity], result of:
          0.020340007 = score(doc=5492,freq=2.0), product of:
            0.10514317 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.03002521 = queryNorm
            0.19345059 = fieldWeight in 5492, 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=5492)
      0.5 = coord(1/2)
  0.071428575 = coord(1/14)
    Date
    20. 1.2015 18:30:22

Authors

Years

Themes