Search (8 results, page 1 of 1)

0.017646596 = product of:
  0.03529319 = sum of:
    0.03529319 = product of:
      0.07058638 = sum of:
        0.07058638 = weight(_text_:22 in 3142) [ClassicSimilarity], result of:
          0.07058638 = score(doc=3142,freq=2.0), product of:
            0.18244034 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.052098576 = queryNorm
            0.38690117 = fieldWeight in 3142, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.078125 = fieldNorm(doc=3142)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Date

26. 2.2008 15:58:22

0.016219966 = product of:
  0.032439932 = sum of:
    0.032439932 = product of:
      0.064879864 = sum of:
        0.064879864 = weight(_text_:web in 2470) [ClassicSimilarity], result of:
          0.064879864 = score(doc=2470,freq=14.0), product of:
            0.17002425 = queryWeight, product of:
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.052098576 = queryNorm
            0.38159183 = fieldWeight in 2470, product of:
              3.7416575 = tf(freq=14.0), with freq of:
                14.0 = termFreq=14.0
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.03125 = fieldNorm(doc=2470)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

The writers show that a faceted navigation structure makes web sites easier to use. They begin by analyzing the web sites of three library and information science faculties, and seeing if the sites easily provide the answers to five specific questions, e.g., how the school ranks in national evaluations. (It is worth noting that the web site of the Faculty of Information Studies and the University of Toronto, where this bibliography is being written, would fail on four of the five questions.) Using examples from LIS web site content, they show how facets can be related and constructed, and use concept diagrams for illustration. They briefly discuss constraints necessary when joining facets: for example, enrolled students can be full- or part-time, but prospective and alumni students cannot. It should not be possible to construct terms such as "part-time alumni" (see Yannis Tzitzikas et al, below in Background). They conclude that a faceted approach is best for web site navigation, because it can clearly show where the user is in the site, what the related pages are, and how to get to them. There is a short discussion of user interfaces, and the diagrams in the paper will be of interest to anyone making a facet-based web site. This paper is clearly written, informative, and thought-provoking. Uta Priss's web site lists her other publications, many of which are related and some of which are online: http://www.upriss.org.uk/top/research.html.

0.015927691 = product of:
  0.031855382 = sum of:
    0.031855382 = product of:
      0.063710764 = sum of:
        0.063710764 = weight(_text_:web in 2737) [ClassicSimilarity], result of:
          0.063710764 = score(doc=2737,freq=6.0), product of:
            0.17002425 = queryWeight, product of:
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.052098576 = queryNorm
            0.37471575 = fieldWeight in 2737, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.046875 = fieldNorm(doc=2737)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

In recent years, knowledge structuring is assuming important roles in several real world applications such as decision support, cooperative problem solving, e-commerce, Semantic Web and, even in planning systems. Ontologies play an important role in supporting automated processes to access information and are at the core of new strategies for the development of knowledge-based systems. Yet, developing an ontology is a time-consuming task which often needs an accurate domain expertise to tackle structural and logical difficulties in the definition of concepts as well as conceivable relationships. This work presents an ontology-based retrieval approach, that supports data organization and visualization and provides a friendly navigation model. It exploits the fuzzy extension of the Formal Concept Analysis theory to elicit conceptualizations from datasets and generate a hierarchy-based representation of extracted knowledge. An intuitive graphical interface provides a multi-facets view of the built ontology. Through a transparent query-based retrieval, final users navigate across concepts, relations and population.

Content

Beitrag in einem Themenheft "Soft Approaches to IA on the Web". Vgl.: doi:10.1016/j.ipm.2011.04.003.

0.01501677 = product of:
  0.03003354 = sum of:
    0.03003354 = product of:
      0.06006708 = sum of:
        0.06006708 = weight(_text_:web in 3291) [ClassicSimilarity], result of:
          0.06006708 = score(doc=3291,freq=12.0), product of:
            0.17002425 = queryWeight, product of:
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.052098576 = queryNorm
            0.35328537 = fieldWeight in 3291, product of:
              3.4641016 = tf(freq=12.0), with freq of:
                12.0 = termFreq=12.0
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.03125 = fieldNorm(doc=3291)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

The web is a network of linked sites whereby each site either forms a physical portal or a standalone page. In the former case, the portal presents an access point to its embedded web pages that coherently present a specific topic. In the latter case, there are millions of standalone web pages, that are scattered throughout the web, having the same topic and could be conceptually linked together to form virtual portals. Search engines have been developed to help users in reaching the adequate pages in an efficient and effective manner. All the known current search engine techniques rely on the web page as the basic atomic search unit. They ignore the conceptual links, that reveal the implicit web related meanings, among the retrieved pages. However, building a semantic model for the whole portal may contain more semantic information than a model of scattered individual pages. In addition, user queries can be poor and contain imprecise terms that do not reflect the real user intention. Consequently, retrieving the standalone individual pages that are directly related to the query may not satisfy the user's need. In this paper, we propose PREFCA, a Portal Retrieval Engine based on Formal Concept Analysis that relies on the portal as the main search unit. PREFCA consists of three phases: First, the information extraction phase that is concerned with extracting portal's semantic data. Second, the formal concept analysis phase that utilizes formal concept analysis to discover the conceptual links among portal and attributes. Finally, the information retrieval phase where we propose a portal ranking method to retrieve ranked pairs of portals and embedded pages. Additionally, we apply the network analysis rules to output some portal characteristics. We evaluated PREFCA using two data sets, namely the Forum for Information Retrieval Evaluation 2010 and ClueWeb09 (category B) test data, for physical and virtual portals respectively. PREFCA proves higher F-measure accuracy, better Mean Average Precision ranking and comparable network analysis and efficiency results than other search engine approaches, namely Term Frequency Inverse Document Frequency (TF-IDF), Latent Semantic Analysis (LSA), and BM25 techniques. As well, it gains high Mean Average Precision in comparison with learning to rank techniques. Moreover, PREFCA also gains better reach time than Carrot as a well-known topic-based search engine.

0.014117276 = product of:
  0.028234553 = sum of:
    0.028234553 = product of:
      0.056469105 = sum of:
        0.056469105 = weight(_text_:22 in 1901) [ClassicSimilarity], result of:
          0.056469105 = score(doc=1901,freq=2.0), product of:
            0.18244034 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.052098576 = queryNorm
            0.30952093 = fieldWeight in 1901, 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=1901)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Source

Knowledge organization. 22(1995) no.2, S.78-81

0.0123526165 = product of:
  0.024705233 = sum of:
    0.024705233 = product of:
      0.049410466 = sum of:
        0.049410466 = weight(_text_:22 in 5095) [ClassicSimilarity], result of:
          0.049410466 = score(doc=5095,freq=2.0), product of:
            0.18244034 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.052098576 = queryNorm
            0.2708308 = fieldWeight in 5095, 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=5095)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Date

22. 1.2016 17:47:06

0.0123526165 = product of:
  0.024705233 = sum of:
    0.024705233 = product of:
      0.049410466 = sum of:
        0.049410466 = weight(_text_:22 in 2654) [ClassicSimilarity], result of:
          0.049410466 = score(doc=2654,freq=2.0), product of:
            0.18244034 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.052098576 = queryNorm
            0.2708308 = fieldWeight in 2654, 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=2654)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Date

22. 1.2016 17:30:31

0.0053642495 = product of:
  0.010728499 = sum of:
    0.010728499 = product of:
      0.021456998 = sum of:
        0.021456998 = weight(_text_:web in 5089) [ClassicSimilarity], result of:
          0.021456998 = score(doc=5089,freq=2.0), product of:
            0.17002425 = queryWeight, product of:
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.052098576 = queryNorm
            0.12619963 = fieldWeight in 5089, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.02734375 = fieldNorm(doc=5089)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Content

Concepts & Language: Knowledge organization by procedures of natural language processing. A case study using the method GABEK (J. Zelger, J. Gadner) - Computer aided narrative analysis using conceptual graphs (H. Schärfe, P. 0hrstrom) - Pragmatic representation of argumentative text: a challenge for the conceptual graph approach (H. Irandoust, B. Moulin) - Conceptual graphs as a knowledge representation core in a complex language learning environment (G. Angelova, A. Nenkova, S. Boycheva, T. Nikolov) - Conceptual Modeling and Ontologies: Relationships and actions in conceptual categories (Ch. Landauer, K.L. Bellman) - Concept approximations for formal concept analysis (J. Saquer, J.S. Deogun) - Faceted information representation (U. Priß) - Simple concept graphs with universal quantifiers (J. Tappe) - A framework for comparing methods for using or reusing multiple ontologies in an application (J. van ZyI, D. Corbett) - Designing task/method knowledge-based systems with conceptual graphs (M. Leclère, F.Trichet, Ch. Choquet) - A logical ontology (J. Farkas, J. Sarbo) - Algorithms and Tools: Fast concept analysis (Ch. Lindig) - A framework for conceptual graph unification (D. Corbett) - Visual CP representation of knowledge (H.D. Pfeiffer, R.T. Hartley) - Maximal isojoin for representing software textual specifications and detecting semantic anomalies (Th. Charnois) - Troika: using grids, lattices and graphs in knowledge acquisition (H.S. Delugach, B.E. Lampkin) - Open world theorem prover for conceptual graphs (J.E. Heaton, P. Kocura) - NetCare: a practical conceptual graphs software tool (S. Polovina, D. Strang) - CGWorld - a web based workbench for conceptual graphs management and applications (P. Dobrev, K. Toutanova) - Position papers: The edition project: Peirce's existential graphs (R. Mülller) - Mining association rules using formal concept analysis (N. Pasquier) - Contextual logic summary (R Wille) - Information channels and conceptual scaling (K.E. Wolff) - Spatial concepts - a rule exploration (S. Rudolph) - The TEXT-TO-ONTO learning environment (A. Mädche, St. Staab) - Controlling the semantics of metadata on audio-visual documents using ontologies (Th. Dechilly, B. Bachimont) - Building the ontological foundations of a terminology from natural language to conceptual graphs with Ribosome, a knowledge extraction system (Ch. Jacquelinet, A. Burgun) - CharGer: some lessons learned and new directions (H.S. Delugach) - Knowledge management using conceptual graphs (W.K. Pun)