Search (11 results, page 1 of 1)

0.049766432 = product of:
  0.39813146 = sum of:
    0.39813146 = weight(_text_:pacific in 4360) [ClassicSimilarity], result of:
      0.39813146 = score(doc=4360,freq=2.0), product of:
        0.3193714 = queryWeight, product of:
          8.059301 = idf(docFreq=37, maxDocs=44218)
          0.03962768 = queryNorm
        1.2466096 = fieldWeight in 4360, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          8.059301 = idf(docFreq=37, maxDocs=44218)
          0.109375 = fieldNorm(doc=4360)
  0.125 = coord(1/8)

Imprint

Pacific Grove, CA : Brooks Cole Publishing Co.

0.013504548 = product of:
  0.054018192 = sum of:
    0.029618902 = weight(_text_:case in 5089) [ClassicSimilarity], result of:
      0.029618902 = score(doc=5089,freq=2.0), product of:
        0.1742197 = queryWeight, product of:
          4.3964143 = idf(docFreq=1480, maxDocs=44218)
          0.03962768 = queryNorm
        0.17000891 = fieldWeight in 5089, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.3964143 = idf(docFreq=1480, maxDocs=44218)
          0.02734375 = fieldNorm(doc=5089)
    0.024399292 = weight(_text_:studies in 5089) [ClassicSimilarity], result of:
      0.024399292 = score(doc=5089,freq=2.0), product of:
        0.15812531 = queryWeight, product of:
          3.9902744 = idf(docFreq=2222, maxDocs=44218)
          0.03962768 = queryNorm
        0.15430352 = fieldWeight in 5089, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.9902744 = idf(docFreq=2222, maxDocs=44218)
          0.02734375 = fieldNorm(doc=5089)
  0.25 = coord(2/8)

Abstract

The 8th International Conference on Conceptual Structures - Logical, Linguistic, and Computational Issues (ICCS 2000) brings together a wide range of researchers and practitioners working with conceptual structures. During the last few years, the ICCS conference series has considerably widened its scope on different kinds of conceptual structures, stimulating research across domain boundaries. We hope that this stimulation is further enhanced by ICCS 2000 joining the long tradition of conferences in Darmstadt with extensive, lively discussions. This volume consists of contributions presented at ICCS 2000, complementing the volume "Conceptual Structures: Logical, Linguistic, and Computational Issues" (B. Ganter, G.W. Mineau (Eds.), LNAI 1867, Springer, Berlin-Heidelberg 2000). It contains submissions reviewed by the program committee, and position papers. We wish to express our appreciation to all the authors of submitted papers, to the general chair, the program chair, the editorial board, the program committee, and to the additional reviewers for making ICCS 2000 a valuable contribution in the knowledge processing research field. Special thanks go to the local organizers for making the conference an enjoyable and inspiring event. We are grateful to Darmstadt University of Technology, the Ernst Schröder Center for Conceptual Knowledge Processing, the Center for Interdisciplinary Studies in Technology, the Deutsche Forschungsgemeinschaft, Land Hessen, and NaviCon GmbH for their generous support

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)

0.0063469075 = product of:
  0.05077526 = sum of:
    0.05077526 = weight(_text_:case in 5088) [ClassicSimilarity], result of:
      0.05077526 = score(doc=5088,freq=2.0), product of:
        0.1742197 = queryWeight, product of:
          4.3964143 = idf(docFreq=1480, maxDocs=44218)
          0.03962768 = queryNorm
        0.29144385 = fieldWeight in 5088, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.3964143 = idf(docFreq=1480, maxDocs=44218)
          0.046875 = fieldNorm(doc=5088)
  0.125 = coord(1/8)

Abstract

We give an overview over the computational tools for conceptional structures that have emerged from the theory of Formal Concept Analysis, with emphasis on basic ideas rather than technical details. We describe what we mean by conceptual computations, and try to convince the reader that an elaborate formalization is a necessary precondition. Claiming that Formal Concept Analysis provides such a formal background, we present as examples two well known algorithms in very simple pseudo code. These earl be used for navigating in a lattice, thereby supporting some prototypical tasks of conceptual computation. We refer to some of the many more advanced methods, discuss how to compute with limited precision and explain why in the case of incomplete knowledge the conceptual approach is more efficient than a combinatorial one. Utilizing this efficiency requires skillful use of the formalism. We present two results that lead in this direction

0.0059839217 = product of:
  0.047871374 = sum of:
    0.047871374 = weight(_text_:case in 3291) [ClassicSimilarity], result of:
      0.047871374 = score(doc=3291,freq=4.0), product of:
        0.1742197 = queryWeight, product of:
          4.3964143 = idf(docFreq=1480, maxDocs=44218)
          0.03962768 = queryNorm
        0.2747759 = fieldWeight in 3291, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          4.3964143 = idf(docFreq=1480, maxDocs=44218)
          0.03125 = fieldNorm(doc=3291)
  0.125 = coord(1/8)

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.00531474 = product of:
  0.04251792 = sum of:
    0.04251792 = product of:
      0.08503584 = sum of:
        0.08503584 = weight(_text_:area in 2204) [ClassicSimilarity], result of:
          0.08503584 = score(doc=2204,freq=2.0), product of:
            0.1952553 = queryWeight, product of:
              4.927245 = idf(docFreq=870, maxDocs=44218)
              0.03962768 = queryNorm
            0.43551105 = fieldWeight in 2204, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.927245 = idf(docFreq=870, maxDocs=44218)
              0.0625 = fieldNorm(doc=2204)
      0.5 = coord(1/2)
  0.125 = coord(1/8)

Abstract

With the continuously growing amount of Internet accessible information resources, locating relevant information in the WWW becomes increasingly difficult. Recent developments provide scalable mechanisms for maintaing indexes of network accessible information. In order to implement sophisticated retrieval engines, a means of automatic analysis and classification of document meta information has to be found. Proposes the use of methods from the mathematical theory of concept analysis to analyze and interactively explore the information space defined by wide area resource discovery services

0.0052890894 = product of:
  0.042312715 = sum of:
    0.042312715 = weight(_text_:case in 4766) [ClassicSimilarity], result of:
      0.042312715 = score(doc=4766,freq=2.0), product of:
        0.1742197 = queryWeight, product of:
          4.3964143 = idf(docFreq=1480, maxDocs=44218)
          0.03962768 = queryNorm
        0.24286987 = fieldWeight in 4766, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.3964143 = idf(docFreq=1480, maxDocs=44218)
          0.0390625 = fieldNorm(doc=4766)
  0.125 = coord(1/8)

Abstract

Current best-match ranking (BMR) systems perform well but cannot handle word mismatch between a query and a document. The best known alternative ranking method, hierarchical clustering-based ranking (HCR), seems to be more robust than BMR with respect to this problem, but it is hampered by theoretical and practical limitations. We present an approach to document ranking that explicitly addresses the word mismatch problem by exploiting interdocument similarity information in a novel way. Document ranking is seen as a query-document transformation driven by a conceptual representation of the whole document collection, into which the query is merged. Our approach is nased on the theory of concept (or Galois) lattices, which, er argue, provides a powerful, well-founded, and conputationally-tractable framework to model the space in which documents and query are represented and to compute such a transformation. We compared information retrieval using concept lattice-based ranking (CLR) to BMR and HCR. The results showed that HCR was outperformed by CLR as well as BMR, and suggested that, of the two best methods, BMR achieved better performance than CLR on the whole document set, whereas CLR compared more favorably when only the first retrieved documents were used for evaluation. We also evaluated the three methods' specific ability to rank documents that did not match the query, in which case the speriority of CLR over BMR and HCR was apparent

0.0034856133 = product of:
  0.027884906 = sum of:
    0.027884906 = weight(_text_:studies in 2470) [ClassicSimilarity], result of:
      0.027884906 = score(doc=2470,freq=2.0), product of:
        0.15812531 = queryWeight, product of:
          3.9902744 = idf(docFreq=2222, maxDocs=44218)
          0.03962768 = queryNorm
        0.17634688 = fieldWeight in 2470, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.9902744 = idf(docFreq=2222, maxDocs=44218)
          0.03125 = fieldNorm(doc=2470)
  0.125 = coord(1/8)

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.003355627 = product of:
  0.026845016 = sum of:
    0.026845016 = product of:
      0.05369003 = sum of:
        0.05369003 = weight(_text_:22 in 3142) [ClassicSimilarity], result of:
          0.05369003 = score(doc=3142,freq=2.0), product of:
            0.13876937 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.03962768 = 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.125 = coord(1/8)

Date

26. 2.2008 15:58:22

0.0026845017 = product of:
  0.021476014 = sum of:
    0.021476014 = product of:
      0.042952027 = sum of:
        0.042952027 = weight(_text_:22 in 1901) [ClassicSimilarity], result of:
          0.042952027 = score(doc=1901,freq=2.0), product of:
            0.13876937 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.03962768 = 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.125 = coord(1/8)

Source

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

0.002348939 = product of:
  0.018791512 = sum of:
    0.018791512 = product of:
      0.037583023 = sum of:
        0.037583023 = weight(_text_:22 in 5095) [ClassicSimilarity], result of:
          0.037583023 = score(doc=5095,freq=2.0), product of:
            0.13876937 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.03962768 = 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.125 = coord(1/8)

Date

22. 1.2016 17:47:06

0.002348939 = product of:
  0.018791512 = sum of:
    0.018791512 = product of:
      0.037583023 = sum of:
        0.037583023 = weight(_text_:22 in 2654) [ClassicSimilarity], result of:
          0.037583023 = score(doc=2654,freq=2.0), product of:
            0.13876937 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.03962768 = 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.125 = coord(1/8)

Date

22. 1.2016 17:30:31