Search (15 results, page 1 of 1)

  • × theme_ss:"Automatisches Klassifizieren"
  • × type_ss:"el"
  1. Reiner, U.: Automatische DDC-Klassifizierung von bibliografischen Titeldatensätzen (2009) 0.06 
    0.06175369 = product of:
  0.12350738 = sum of:
    0.12350738 = sum of:
      0.052776836 = weight(_text_:retrieval in 611) [ClassicSimilarity], result of:
        0.052776836 = score(doc=611,freq=2.0), product of:
          0.15791564 = queryWeight, product of:
            3.024915 = idf(docFreq=5836, maxDocs=44218)
            0.052204985 = queryNorm
          0.33420905 = fieldWeight in 611, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.024915 = idf(docFreq=5836, maxDocs=44218)
            0.078125 = fieldNorm(doc=611)
      0.070730545 = weight(_text_:22 in 611) [ClassicSimilarity], result of:
        0.070730545 = score(doc=611,freq=2.0), product of:
          0.18281296 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.052204985 = queryNorm
          0.38690117 = fieldWeight in 611, 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=611)
  0.5 = coord(1/2)
    Date
    22. 8.2009 12:54:24
    Theme
    Klassifikationssysteme im Online-Retrieval
  2. Reiner, U.: Automatische DDC-Klassifizierung bibliografischer Titeldatensätze der Deutschen Nationalbibliografie (2009) 0.02 
    0.024701476 = product of:
  0.049402952 = sum of:
    0.049402952 = sum of:
      0.021110734 = weight(_text_:retrieval in 3284) [ClassicSimilarity], result of:
        0.021110734 = score(doc=3284,freq=2.0), product of:
          0.15791564 = queryWeight, product of:
            3.024915 = idf(docFreq=5836, maxDocs=44218)
            0.052204985 = queryNorm
          0.13368362 = fieldWeight in 3284, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.024915 = idf(docFreq=5836, maxDocs=44218)
            0.03125 = fieldNorm(doc=3284)
      0.028292218 = weight(_text_:22 in 3284) [ClassicSimilarity], result of:
        0.028292218 = score(doc=3284,freq=2.0), product of:
          0.18281296 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.052204985 = queryNorm
          0.15476047 = fieldWeight in 3284, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.03125 = fieldNorm(doc=3284)
  0.5 = coord(1/2)
    Abstract
    Die Menge der zu klassifizierenden Veröffentlichungen steigt spätestens seit der Existenz des World Wide Web schneller an, als sie intellektuell sachlich erschlossen werden kann. Daher werden Verfahren gesucht, um die Klassifizierung von Textobjekten zu automatisieren oder die intellektuelle Klassifizierung zumindest zu unterstützen. Seit 1968 gibt es Verfahren zur automatischen Dokumentenklassifizierung (Information Retrieval, kurz: IR) und seit 1992 zur automatischen Textklassifizierung (ATC: Automated Text Categorization). Seit immer mehr digitale Objekte im World Wide Web zur Verfügung stehen, haben Arbeiten zur automatischen Textklassifizierung seit ca. 1998 verstärkt zugenommen. Dazu gehören seit 1996 auch Arbeiten zur automatischen DDC-Klassifizierung bzw. RVK-Klassifizierung von bibliografischen Titeldatensätzen und Volltextdokumenten. Bei den Entwicklungen handelt es sich unseres Wissens bislang um experimentelle und keine im ständigen Betrieb befindlichen Systeme. Auch das VZG-Projekt Colibri/DDC ist seit 2006 u. a. mit der automatischen DDC-Klassifizierung befasst. Die diesbezüglichen Untersuchungen und Entwicklungen dienen zur Beantwortung der Forschungsfrage: "Ist es möglich, eine inhaltlich stimmige DDC-Titelklassifikation aller GVK-PLUS-Titeldatensätze automatisch zu erzielen?"
    Date
    22. 1.2010 14:41:24
  3. Wätjen, H.-J.; Diekmann, B.; Möller, G.; Carstensen, K.-U.: Bericht zum DFG-Projekt: GERHARD : German Harvest Automated Retrieval and Directory (1998) 0.02 
    0.018659428 = product of:
  0.037318856 = sum of:
    0.037318856 = product of:
      0.07463771 = sum of:
        0.07463771 = weight(_text_:retrieval in 3065) [ClassicSimilarity], result of:
          0.07463771 = score(doc=3065,freq=4.0), product of:
            0.15791564 = queryWeight, product of:
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.052204985 = queryNorm
            0.47264296 = fieldWeight in 3065, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.078125 = fieldNorm(doc=3065)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Theme
    Klassifikationssysteme im Online-Retrieval
  4. GERHARD : eine Spezialsuchmaschine für die Wissenschaft (1998) 0.02 
    0.01583305 = product of:
  0.0316661 = sum of:
    0.0316661 = product of:
      0.0633322 = sum of:
        0.0633322 = weight(_text_:retrieval in 381) [ClassicSimilarity], result of:
          0.0633322 = score(doc=381,freq=2.0), product of:
            0.15791564 = queryWeight, product of:
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.052204985 = queryNorm
            0.40105087 = fieldWeight in 381, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.09375 = fieldNorm(doc=381)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Theme
    Klassifikationssysteme im Online-Retrieval
  5. Koch, T.; Ardö, A.; Brümmer, A.: ¬The building and maintenance of robot based internet search services : A review of current indexing and data collection methods. Prepared to meet the requirements of Work Package 3 of EU Telematics for Research, project DESIRE. Version D3.11v0.3 (Draft version 3) (1996) 0.01 
    0.013963438 = product of:
  0.027926875 = sum of:
    0.027926875 = product of:
      0.05585375 = sum of:
        0.05585375 = weight(_text_:retrieval in 1669) [ClassicSimilarity], result of:
          0.05585375 = score(doc=1669,freq=14.0), product of:
            0.15791564 = queryWeight, product of:
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.052204985 = queryNorm
            0.3536936 = fieldWeight in 1669, product of:
              3.7416575 = tf(freq=14.0), with freq of:
                14.0 = termFreq=14.0
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.03125 = fieldNorm(doc=1669)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Abstract
    After a short outline of problems, possibilities and difficulties of systematic information retrieval on the Internet and a description of efforts for development in this area, a specification of the terminology for this report is required. Although the process of retrieval is generally seen as an iterative process of browsing and information retrieval and several important services on the net have taken this fact into consideration, the emphasis of this report lays on the general retrieval tools for the whole of Internet. In order to be able to evaluate the differences, possibilities and restrictions of the different services it is necessary to begin with organizing the existing varieties in a typological/ taxonomical survey. The possibilities and weaknesses will be briefly compared and described for the most important services in the categories robot-based WWW-catalogues of different types, list- or form-based catalogues and simultaneous or collected search services respectively. It will however for different reasons not be possible to rank them in order of "best" services. Still more important are the weaknesses and problems common for all attempts of indexing the Internet. The problems of the quality of the input, the technical performance and the general problem of indexing virtual hypertext are shown to be at least as difficult as the different aspects of harvesting, indexing and information retrieval. Some of the attempts made in the area of further development of retrieval services will be mentioned in relation to descriptions of the contents of documents and standardization efforts. Internet harvesting and indexing technology and retrieval software is thoroughly reviewed. Details about all services and software are listed in analytical forms in Annex 1-3.
  6. Wätjen, H.-J.: Automatisches Sammeln, Klassifizieren und Indexieren von wissenschaftlich relevanten Informationsressourcen im deutschen World Wide Web : das DFG-Projekt GERHARD (1998) 0.01 
    0.013194209 = product of:
  0.026388418 = sum of:
    0.026388418 = product of:
      0.052776836 = sum of:
        0.052776836 = weight(_text_:retrieval in 3066) [ClassicSimilarity], result of:
          0.052776836 = score(doc=3066,freq=2.0), product of:
            0.15791564 = queryWeight, product of:
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.052204985 = queryNorm
            0.33420905 = fieldWeight in 3066, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.078125 = fieldNorm(doc=3066)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Theme
    Klassifikationssysteme im Online-Retrieval
  7. Shafer, K.E.: Evaluating Scorpion results (1998) 0.01 
    0.013194209 = product of:
  0.026388418 = sum of:
    0.026388418 = product of:
      0.052776836 = sum of:
        0.052776836 = weight(_text_:retrieval in 1569) [ClassicSimilarity], result of:
          0.052776836 = score(doc=1569,freq=2.0), product of:
            0.15791564 = queryWeight, product of:
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.052204985 = queryNorm
            0.33420905 = fieldWeight in 1569, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.078125 = fieldNorm(doc=1569)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Abstract
    Scorpion is a research project at OCLC that builds tools for automatic subject assignment by combining library science and information retrieval techniques. A thesis of Scorpion is that the Dewey Decimal Classification (Dewey) can be used to perform automatic subject assignment for electronic items.
  8. Automatic classification research at OCLC (2002) 0.01 
    0.012377845 = product of:
  0.02475569 = sum of:
    0.02475569 = product of:
      0.04951138 = sum of:
        0.04951138 = weight(_text_:22 in 1563) [ClassicSimilarity], result of:
          0.04951138 = score(doc=1563,freq=2.0), product of:
            0.18281296 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.052204985 = queryNorm
            0.2708308 = fieldWeight in 1563, 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=1563)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Date
    5. 5.2003 9:22:09
  9. Search Engines and Beyond : Developing efficient knowledge management systems, April 19-20 1999, Boston, Mass (1999) 0.01 
    0.01180126 = product of:
  0.02360252 = sum of:
    0.02360252 = product of:
      0.04720504 = sum of:
        0.04720504 = weight(_text_:retrieval in 2596) [ClassicSimilarity], result of:
          0.04720504 = score(doc=2596,freq=10.0), product of:
            0.15791564 = queryWeight, product of:
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.052204985 = queryNorm
            0.29892567 = fieldWeight in 2596, product of:
              3.1622777 = tf(freq=10.0), with freq of:
                10.0 = termFreq=10.0
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.03125 = fieldNorm(doc=2596)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Content
    Ramana Rao (Inxight, Palo Alto, CA) 7 ± 2 Insights on achieving Effective Information Access Session One: Updates and a twelve month perspective Danny Sullivan (Search Engine Watch, US / England) Portalization and other search trends Carol Tenopir (University of Tennessee) Search realities faced by end users and professional searchers Session Two: Today's search engines and beyond Daniel Hoogterp (Retrieval Technologies, McLean, VA) Effective presentation and utilization of search techniques Rick Kenny (Fulcrum Technologies, Ontario, Canada) Beyond document clustering: The knowledge impact statement Gary Stock (Ingenius, Kalamazoo, MI) Automated change monitoring Gary Culliss (Direct Hit, Wellesley Hills, MA) User popularity ranked search engines Byron Dom (IBM, CA) Automatically finding the best pages on the World Wide Web (CLEVER) Peter Tomassi (LookSmart, San Francisco, CA) Adding human intellect to search technology Session Three: Panel discussion: Human v automated categorization and editing Ev Brenner (New York, NY)- Chairman James Callan (University of Massachusetts, MA) Marc Krellenstein (Northern Light Technology, Cambridge, MA) Dan Miller (Ask Jeeves, Berkeley, CA) Session Four: Updates and a twelve month perspective Steve Arnold (AIT, Harrods Creek, KY) Review: The leading edge in search and retrieval software Ellen Voorhees (NIST, Gaithersburg, MD) TREC update Session Five: Search engines now and beyond Intelligent Agents John Snyder (Muscat, Cambridge, England) Practical issues behind intelligent agents Text summarization Therese Firmin, (Dept of Defense, Ft George G. Meade, MD) The TIPSTER/SUMMAC evaluation of automatic text summarization systems Cross language searching Elizabeth Liddy (TextWise, Syracuse, NY) A conceptual interlingua approach to cross-language retrieval. Video search and retrieval Armon Amir (IBM, Almaden, CA) CueVideo: Modular system for automatic indexing and browsing of video/audio Speech recognition Michael Witbrock (Lycos, Waltham, MA) Retrieval of spoken documents Visualization James A. Wise (Integral Visuals, Richland, WA) Information visualization in the new millennium: Emerging science or passing fashion? Text mining David Evans (Claritech, Pittsburgh, PA) Text mining - towards decision support
  10. Dolin, R.; Agrawal, D.; El Abbadi, A.; Pearlman, J.: Using automated classification for summarizing and selecting heterogeneous information sources (1998) 0.01 
    0.011195658 = product of:
  0.022391316 = sum of:
    0.022391316 = product of:
      0.04478263 = sum of:
        0.04478263 = weight(_text_:retrieval in 316) [ClassicSimilarity], result of:
          0.04478263 = score(doc=316,freq=4.0), product of:
            0.15791564 = queryWeight, product of:
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.052204985 = queryNorm
            0.2835858 = fieldWeight in 316, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.046875 = fieldNorm(doc=316)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Abstract
    Information retrieval over the Internet increasingly requires the filtering of thousands of heterogeneous information sources. Important sources of information include not only traditional databases with structured data and queries, but also increasing numbers of non-traditional, semi- or unstructured collections such as Web sites, FTP archives, etc. As the number and variability of sources increases, new ways of automatically summarizing, discovering, and selecting collections relevant to a user's query are needed. One such method involves the use of classification schemes, such as the Library of Congress Classification (LCC) [10], within which a collection may be represented based on its content, irrespective of the structure of the actual data or documents. For such a system to be useful in a large-scale distributed environment, it must be easy to use for both collection managers and users. As a result, it must be possible to classify documents automatically within a classification scheme. Furthermore, there must be a straightforward and intuitive interface with which the user may use the scheme to assist in information retrieval (IR).
  11. Chan, L.M.; Lin, X.; Zeng, M.: Structural and multilingual approaches to subject access on the Web (1999) 0.01 
    0.010555367 = product of:
  0.021110734 = sum of:
    0.021110734 = product of:
      0.042221468 = sum of:
        0.042221468 = weight(_text_:retrieval in 162) [ClassicSimilarity], result of:
          0.042221468 = score(doc=162,freq=2.0), product of:
            0.15791564 = queryWeight, product of:
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.052204985 = queryNorm
            0.26736724 = fieldWeight in 162, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.0625 = fieldNorm(doc=162)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Abstract
    Zu den großen Herausforderungen einer sinnvollen Suche im WWW gehören die riesige Menge des Verfügbaren und die Sparchbarrieren. Verfahren, die die Web-Ressourcen im Hinblick auf ein effizienteres Retrieval inhaltlich strukturieren, werden daher ebenso dringend benötigt wie Programme, die mit der Sprachvielfalt umgehen können. Im folgenden Vortrag werden wir einige Ansätze diskutieren, die zur Bewältigung der beiden Probleme derzeit unternommen werden
  12. Godby, C. J.; Stuler, J.: ¬The Library of Congress Classification as a knowledge base for automatic subject categorization (2001) 0.01 
    0.010555367 = product of:
  0.021110734 = sum of:
    0.021110734 = product of:
      0.042221468 = sum of:
        0.042221468 = weight(_text_:retrieval in 1567) [ClassicSimilarity], result of:
          0.042221468 = score(doc=1567,freq=2.0), product of:
            0.15791564 = queryWeight, product of:
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.052204985 = queryNorm
            0.26736724 = fieldWeight in 1567, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.0625 = fieldNorm(doc=1567)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Footnote
    Paper, IFLA Preconference "Subject Retrieval in a Networked Environment", Dublin, OH, August 2001.
  13. Koch, T.; Vizine-Goetz, D.: DDC and knowledge organization in the digital library : Research and development. Demonstration pages (1999) 0.01 
    0.007916525 = product of:
  0.01583305 = sum of:
    0.01583305 = product of:
      0.0316661 = sum of:
        0.0316661 = weight(_text_:retrieval in 942) [ClassicSimilarity], result of:
          0.0316661 = score(doc=942,freq=2.0), product of:
            0.15791564 = queryWeight, product of:
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.052204985 = queryNorm
            0.20052543 = fieldWeight in 942, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.046875 = fieldNorm(doc=942)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Theme
    Klassifikationssysteme im Online-Retrieval
  14. Hagedorn, K.; Chapman, S.; Newman, D.: Enhancing search and browse using automated clustering of subject metadata (2007) 0.01 
    0.007916525 = product of:
  0.01583305 = sum of:
    0.01583305 = product of:
      0.0316661 = sum of:
        0.0316661 = weight(_text_:retrieval in 1168) [ClassicSimilarity], result of:
          0.0316661 = score(doc=1168,freq=2.0), product of:
            0.15791564 = queryWeight, product of:
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.052204985 = queryNorm
            0.20052543 = fieldWeight in 1168, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.046875 = fieldNorm(doc=1168)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Abstract
    The Web puzzle of online information resources often hinders end-users from effective and efficient access to these resources. Clustering resources into appropriate subject-based groupings may help alleviate these difficulties, but will it work with heterogeneous material? The University of Michigan and the University of California Irvine joined forces to test automatically enhancing metadata records using the Topic Modeling algorithm on the varied OAIster corpus. We created labels for the resulting clusters of metadata records, matched the clusters to an in-house classification system, and developed a prototype that would showcase methods for search and retrieval using the enhanced records. Results indicated that while the algorithm was somewhat time-intensive to run and using a local classification scheme had its drawbacks, precise clustering of records was achieved and the prototype interface proved that faceted classification could be powerful in helping end-users find resources.
  15. Dolin, R.; Agrawal, D.; El Abbadi, A.; Pearlman, J.: Using automated classification for summarizing and selecting heterogeneous information sources (1998) 0.01 
    0.005597829 = product of:
  0.011195658 = sum of:
    0.011195658 = product of:
      0.022391316 = sum of:
        0.022391316 = weight(_text_:retrieval in 1253) [ClassicSimilarity], result of:
          0.022391316 = score(doc=1253,freq=4.0), product of:
            0.15791564 = queryWeight, product of:
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.052204985 = queryNorm
            0.1417929 = fieldWeight in 1253, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.0234375 = fieldNorm(doc=1253)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Abstract
    Information retrieval over the Internet increasingly requires the filtering of thousands of heterogeneous information sources. Important sources of information include not only traditional databases with structured data and queries, but also increasing numbers of non-traditional, semi- or unstructured collections such as Web sites, FTP archives, etc. As the number and variability of sources increases, new ways of automatically summarizing, discovering, and selecting collections relevant to a user's query are needed. One such method involves the use of classification schemes, such as the Library of Congress Classification (LCC), within which a collection may be represented based on its content, irrespective of the structure of the actual data or documents. For such a system to be useful in a large-scale distributed environment, it must be easy to use for both collection managers and users. As a result, it must be possible to classify documents automatically within a classification scheme. Furthermore, there must be a straightforward and intuitive interface with which the user may use the scheme to assist in information retrieval (IR). Our work with the Alexandria Digital Library (ADL) Project focuses on geo-referenced information, whether text, maps, aerial photographs, or satellite images. As a result, we have emphasized techniques which work with both text and non-text, such as combined textual and graphical queries, multi-dimensional indexing, and IR methods which are not solely dependent on words or phrases. Part of this work involves locating relevant online sources of information. In particular, we have designed and are currently testing aspects of an architecture, Pharos, which we believe will scale up to 1.000.000 heterogeneous sources. Pharos accommodates heterogeneity in content and format, both among multiple sources as well as within a single source. That is, we consider sources to include Web sites, FTP archives, newsgroups, and full digital libraries; all of these systems can include a wide variety of content and multimedia data formats. Pharos is based on the use of hierarchical classification schemes. These include not only well-known 'subject' (or 'concept') based schemes such as the Dewey Decimal System and the LCC, but also, for example, geographic classifications, which might be constructed as layers of smaller and smaller hierarchical longitude/latitude boxes. Pharos is designed to work with sophisticated queries which utilize subjects, geographical locations, temporal specifications, and other types of information domains. The Pharos architecture requires that hierarchically structured collection metadata be extracted so that it can be partitioned in such a way as to greatly enhance scalability. Automated classification is important to Pharos because it allows information sources to extract the requisite collection metadata automatically that must be distributed.

Authors

Years

Languages

  • e 10
  • d 5

Types

Themes