Search (5 results, page 1 of 1)

  • × author_ss:"Lim, E.-P."
  • × year_i:[2000 TO 2010}
  1. Lauw, H.W.; Lim, E.-P.: Web social mining (2009) 0.05
    0.05474496 = product of:
      0.16423488 = sum of:
        0.067437425 = weight(_text_:wide in 3905) [ClassicSimilarity], result of:
          0.067437425 = score(doc=3905,freq=2.0), product of:
            0.19679762 = queryWeight, product of:
              4.4307585 = idf(docFreq=1430, maxDocs=44218)
              0.044416238 = queryNorm
            0.342674 = fieldWeight in 3905, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.4307585 = idf(docFreq=1430, maxDocs=44218)
              0.0546875 = fieldNorm(doc=3905)
        0.09679745 = weight(_text_:web in 3905) [ClassicSimilarity], result of:
          0.09679745 = score(doc=3905,freq=14.0), product of:
            0.14495286 = queryWeight, product of:
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.044416238 = queryNorm
            0.6677857 = fieldWeight in 3905, product of:
              3.7416575 = tf(freq=14.0), with freq of:
                14.0 = termFreq=14.0
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.0546875 = fieldNorm(doc=3905)
      0.33333334 = coord(2/6)
    
    Abstract
    With increasing user presence in the Web and Web 2.0, Web social mining becomes an important and challenging task that finds a wide range of new applications relevant to e-commerce and social software. In this entry, we describe three Web social mining topics, namely, social network discovery, social network analysis, and social network applications. The essential concepts, models, and techniques of these Web social mining topics will be surveyed so as to establish the basic foundation for developing novel applications and for conducting research.
    Object
    Web 2.0
  2. Sun, A.; Lim, E.-P.: Web unit-based mining of homepage relationships (2006) 0.03
    0.026352208 = product of:
      0.07905662 = sum of:
        0.064012155 = weight(_text_:web in 5274) [ClassicSimilarity], result of:
          0.064012155 = score(doc=5274,freq=12.0), product of:
            0.14495286 = queryWeight, product of:
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.044416238 = queryNorm
            0.4416067 = fieldWeight in 5274, product of:
              3.4641016 = tf(freq=12.0), with freq of:
                12.0 = termFreq=12.0
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.0390625 = fieldNorm(doc=5274)
        0.0150444675 = product of:
          0.030088935 = sum of:
            0.030088935 = weight(_text_:22 in 5274) [ClassicSimilarity], result of:
              0.030088935 = score(doc=5274,freq=2.0), product of:
                0.1555381 = queryWeight, product of:
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.044416238 = queryNorm
                0.19345059 = fieldWeight in 5274, 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=5274)
          0.5 = coord(1/2)
      0.33333334 = coord(2/6)
    
    Abstract
    Homepages usually describe important semantic information about conceptual or physical entities; hence, they are the main targets for searching and browsing. To facilitate semantic-based information retrieval (IR) at a Web site, homepages can be identified and classified under some predefined concepts and these concepts are then used in query or browsing criteria, e.g., finding professor homepages containing information retrieval. In some Web sites, relationships may also exist among homepages. These relationship instances (also known as homepage relationships) enrich our knowledge about these Web sites and allow more expressive semantic-based IR. In this article, we investigate the features to be used in mining homepage relationships. We systematically develop different classes of inter-homepage features, namely, navigation, relative-location, and common-item features. We also propose deriving for each homepage a set of support pages to obtain richer and more complete content about the entity described by the homepage. The homepage together with its support pages are known to be a Web unit. By extracting inter-homepage features from Web units, our experiments on the WebKB dataset show that better homepage relationship mining accuracies can be achieved.
    Date
    22. 7.2006 16:18:25
  3. Naing, M.-M.; Lim, E.-P.; Chiang, R.H.L.: Extracting link chains of relationship instances from a Web site (2006) 0.02
    0.015679711 = product of:
      0.094078265 = sum of:
        0.094078265 = weight(_text_:web in 6111) [ClassicSimilarity], result of:
          0.094078265 = score(doc=6111,freq=18.0), product of:
            0.14495286 = queryWeight, product of:
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.044416238 = queryNorm
            0.64902663 = fieldWeight in 6111, product of:
              4.2426405 = tf(freq=18.0), with freq of:
                18.0 = termFreq=18.0
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.046875 = fieldNorm(doc=6111)
      0.16666667 = coord(1/6)
    
    Abstract
    Web pages from a Web site can often be associated with concepts in an ontology, and pairs of Web pages also can be associated with relationships between concepts. With such associations, the Web site can be searched, browsed, or even reorganized based on the concept and relationship labels of its Web pages. In this article, we study the link chain extraction problem that is critical to the extraction of Web pages that are related. A link chain is an ordered list of anchor elements linking two Web pages related by some semantic relationship. We propose a link chain extraction method that derives extraction rules for identifying the anchor elements forming the link chains. We applied the proposed method to two well-structured Web sites and found that its performance in terms of precision and recall is good, even with a small number of training examples.
  4. Lim, E.-P.; Liu, Z.; Yin, M.; Goh, D.H.-L.; Theng, Y.-L.; Ng, W.K.: On organizing and accessing geospatial and georeferenced Web resources using the G-Portal system (2005) 0.01
    0.006159573 = product of:
      0.036957435 = sum of:
        0.036957435 = weight(_text_:web in 1049) [ClassicSimilarity], result of:
          0.036957435 = score(doc=1049,freq=4.0), product of:
            0.14495286 = queryWeight, product of:
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.044416238 = queryNorm
            0.25496176 = fieldWeight in 1049, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.0390625 = fieldNorm(doc=1049)
      0.16666667 = coord(1/6)
    
    Abstract
    In order to organise and manage geospatial and georeferenced information on the Web making them convenient for searching and browsing, a digital portal known as G-Portal has been designed and implemented. Compared to other digital libraries, G-Portal is unique for several of its features. It maintains metadata resources in XML with flexible resource schemas. Logical groupings of metadata resources as projects and layers are possible to allow the entire metadata collection to be partitioned differently for users with different information needs. These metadata resources can be displayed in both the classification-based and map-based interfaces provided by G-Portal. G-Portal further incorporates both a query module and an annotation module for users to search metadata and to create additional knowledge for sharing respectively. G-Portal also includes a resource classification module that categorizes resources into one or more hierarchical category trees based on user-defined classification schemas. This paper gives an overview of the G-Portal design and implementation. The portal features will be illustrated using a collection of high school geography examination-related resources.
  5. Theng, Y.-L.; Goh, D.H.-L.; Lim, E.-P.; Liu, Z.; Yin, M.; Pang, N.L.-S.; Wong, P.B.-B.: Applying scenario-based design and claims analysis to the design of a digital library of geography examination resources (2005) 0.01
    0.0052265706 = product of:
      0.031359423 = sum of:
        0.031359423 = weight(_text_:web in 1002) [ClassicSimilarity], result of:
          0.031359423 = score(doc=1002,freq=2.0), product of:
            0.14495286 = queryWeight, product of:
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.044416238 = queryNorm
            0.21634221 = fieldWeight in 1002, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.046875 = fieldNorm(doc=1002)
      0.16666667 = coord(1/6)
    
    Abstract
    This paper describes the application of Carroll's scenario-based design and claims analysis as a means of refinement to the initial design of a digital library of geographical resources (GeogDL) to prepare Singapore students to take a national examination in geography. GeogDL is built on top of G-Portal, a digital library providing services over geospatial and georeferenced Web content. Beyond improving the initial design of GeogDL, a main contribution of the paper is making explicit the use of Carroll's strong theory-based but undercapitalized scenario-based design and claims analysis that inspired recommendations for the refinement of GeogDL. The paper concludes with an overview of the implementation of some of the recommendations identified in the study to address "usability" and "usefulness" design issues in GeogDL, and discusses implications of the findings in relation to geospatial digital libraries in general.