Search (5 results, page 1 of 1)

  • × author_ss:"Li, D."
  1. Li, D.; Kwong, C.-P.: Understanding latent semantic indexing : a topological structure analysis using Q-analysis (2010) 0.00 
    0.0041203364 = product of:
  0.02060168 = sum of:
    0.02060168 = product of:
      0.04120336 = sum of:
        0.04120336 = weight(_text_:problems in 3427) [ClassicSimilarity], result of:
          0.04120336 = score(doc=3427,freq=2.0), product of:
            0.15058853 = queryWeight, product of:
              4.1274753 = idf(docFreq=1937, maxDocs=44218)
              0.036484417 = queryNorm
            0.27361554 = fieldWeight in 3427, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.1274753 = idf(docFreq=1937, maxDocs=44218)
              0.046875 = fieldNorm(doc=3427)
      0.5 = coord(1/2)
  0.2 = coord(1/5)
    Abstract
    The method of latent semantic indexing (LSI) is well-known for tackling the synonymy and polysemy problems in information retrieval; however, its performance can be very different for various datasets, and the questions of what characteristics of a dataset and why these characteristics contribute to this difference have not been fully understood. In this article, we propose that the mathematical structure of simplexes can be attached to a term-document matrix in the vector space model (VSM) for information retrieval. The Q-analysis devised by R.H. Atkin ([1974]) may then be applied to effect an analysis of the topological structure of the simplexes and their corresponding dataset. Experimental results of this analysis reveal that there is a correlation between the effectiveness of LSI and the topological structure of the dataset. By using the information obtained from the topological analysis, we develop a new method to explore the semantic information in a dataset. Experimental results show that our method can enhance the performance of VSM for datasets over which LSI is not effective.
  2. Li, H.; Wu, H.; Li, D.; Lin, S.; Su, Z.; Luo, X.: PSI: A probabilistic semantic interpretable framework for fine-grained image ranking (2018) 0.00 
    0.0041203364 = product of:
  0.02060168 = sum of:
    0.02060168 = product of:
      0.04120336 = sum of:
        0.04120336 = weight(_text_:problems in 4577) [ClassicSimilarity], result of:
          0.04120336 = score(doc=4577,freq=2.0), product of:
            0.15058853 = queryWeight, product of:
              4.1274753 = idf(docFreq=1937, maxDocs=44218)
              0.036484417 = queryNorm
            0.27361554 = fieldWeight in 4577, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.1274753 = idf(docFreq=1937, maxDocs=44218)
              0.046875 = fieldNorm(doc=4577)
      0.5 = coord(1/2)
  0.2 = coord(1/5)
    Abstract
    Image Ranking is one of the key problems in information science research area. However, most current methods focus on increasing the performance, leaving the semantic gap problem, which refers to the learned ranking models are hard to be understood, remaining intact. Therefore, in this article, we aim at learning an interpretable ranking model to tackle the semantic gap in fine-grained image ranking. We propose to combine attribute-based representation and online passive-aggressive (PA) learning based ranking models to achieve this goal. Besides, considering the highly localized instances in fine-grained image ranking, we introduce a supervised constrained clustering method to gather class-balanced training instances for local PA-based models, and incorporate the learned local models into a unified probabilistic framework. Extensive experiments on the benchmark demonstrate that the proposed framework outperforms state-of-the-art methods in terms of accuracy and speed.
  3. Shen, X.; Li, D.; Shen, C.: Evaluating China's university library Web sites using correspondence analysis (2006) 0.00 
    0.003954508 = product of:
  0.019772539 = sum of:
    0.019772539 = product of:
      0.039545078 = sum of:
        0.039545078 = weight(_text_:22 in 5277) [ClassicSimilarity], result of:
          0.039545078 = score(doc=5277,freq=2.0), product of:
            0.12776221 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.036484417 = queryNorm
            0.30952093 = fieldWeight in 5277, 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=5277)
      0.5 = coord(1/2)
  0.2 = coord(1/5)
    Date
    22. 7.2006 16:40:18
  4. Li, D.; Luo, Z.; Ding, Y.; Tang, J.; Sun, G.G.-Z.; Dai, X.; Du, J.; Zhang, J.; Kong, S.: User-level microblogging recommendation incorporating social influence (2017) 0.00 
    0.0034336136 = product of:
  0.017168067 = sum of:
    0.017168067 = product of:
      0.034336135 = sum of:
        0.034336135 = weight(_text_:problems in 3426) [ClassicSimilarity], result of:
          0.034336135 = score(doc=3426,freq=2.0), product of:
            0.15058853 = queryWeight, product of:
              4.1274753 = idf(docFreq=1937, maxDocs=44218)
              0.036484417 = queryNorm
            0.22801295 = fieldWeight in 3426, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.1274753 = idf(docFreq=1937, maxDocs=44218)
              0.0390625 = fieldNorm(doc=3426)
      0.5 = coord(1/2)
  0.2 = coord(1/5)
    Abstract
    With the information overload of user-generated content in microblogging, users find it extremely challenging to browse and find valuable information in their first attempt. In this paper we propose a microblogging recommendation algorithm, TSI-MR (Topic-Level Social Influence-based Microblogging Recommendation), which can significantly improve users' microblogging experiences. The main innovation of this proposed algorithm is that we consider social influences and their indirect structural relationships, which are largely based on social status theory, from the topic level. The primary advantage of this approach is that it can build an accurate description of latent relationships between two users with weak connections, which can improve the performance of the model; furthermore, it can solve sparsity problems of training data to a certain extent. The realization of the model is mainly based on Factor Graph. We also applied a distributed strategy to further improve the efficiency of the model. Finally, we use data from Tencent Weibo, one of the most popular microblogging services in China, to evaluate our methods. The results show that incorporating social influence can improve microblogging performance considerably, and outperform the baseline methods.
  5. Li, D.: Knowledge representation and discovery based on linguistic atoms (1998) 0.00 
    0.002965881 = product of:
  0.014829405 = sum of:
    0.014829405 = product of:
      0.02965881 = sum of:
        0.02965881 = weight(_text_:22 in 3836) [ClassicSimilarity], result of:
          0.02965881 = score(doc=3836,freq=2.0), product of:
            0.12776221 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.036484417 = queryNorm
            0.23214069 = fieldWeight in 3836, 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=3836)
      0.5 = coord(1/2)
  0.2 = coord(1/5)
    Footnote
    Contribution to a special issue of selected papers from the Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD'97), held Singapore, 22-23 Feb 1997

Authors

Years

Themes