-
Wätjen, H.-J.: Automatisches Sammeln, Klassifizieren und Indexieren von wissenschaftlich relevanten Informationsressourcen im deutschen World Wide Web : das DFG-Projekt GERHARD (1998)
0.05
0.04953496 = product of:
0.14860488 = sum of:
0.09633918 = weight(_text_:wide in 3066) [ClassicSimilarity], result of:
0.09633918 = score(doc=3066,freq=2.0), product of:
0.19679762 = queryWeight, product of:
4.4307585 = idf(docFreq=1430, maxDocs=44218)
0.044416238 = queryNorm
0.48953426 = fieldWeight in 3066, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.4307585 = idf(docFreq=1430, maxDocs=44218)
0.078125 = fieldNorm(doc=3066)
0.052265707 = weight(_text_:web in 3066) [ClassicSimilarity], result of:
0.052265707 = score(doc=3066,freq=2.0), product of:
0.14495286 = queryWeight, product of:
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.044416238 = queryNorm
0.36057037 = fieldWeight in 3066, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.078125 = fieldNorm(doc=3066)
0.33333334 = coord(2/6)
-
Reiner, U.: Automatische DDC-Klassifizierung bibliografischer Titeldatensätze der Deutschen Nationalbibliografie (2009)
0.05
0.048049595 = product of:
0.09609919 = sum of:
0.05449767 = weight(_text_:wide in 3284) [ClassicSimilarity], result of:
0.05449767 = score(doc=3284,freq=4.0), product of:
0.19679762 = queryWeight, product of:
4.4307585 = idf(docFreq=1430, maxDocs=44218)
0.044416238 = queryNorm
0.2769224 = fieldWeight in 3284, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
4.4307585 = idf(docFreq=1430, maxDocs=44218)
0.03125 = fieldNorm(doc=3284)
0.029565949 = weight(_text_:web in 3284) [ClassicSimilarity], result of:
0.029565949 = score(doc=3284,freq=4.0), product of:
0.14495286 = queryWeight, product of:
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.044416238 = queryNorm
0.2039694 = fieldWeight in 3284, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.03125 = fieldNorm(doc=3284)
0.012035574 = product of:
0.024071148 = sum of:
0.024071148 = weight(_text_:22 in 3284) [ClassicSimilarity], result of:
0.024071148 = score(doc=3284,freq=2.0), product of:
0.1555381 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.044416238 = 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)
0.5 = coord(3/6)
- 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
-
Subramanian, S.; Shafer, K.E.: Clustering (1998)
0.04
0.039268494 = product of:
0.11780548 = sum of:
0.052265707 = weight(_text_:web in 1103) [ClassicSimilarity], result of:
0.052265707 = score(doc=1103,freq=2.0), product of:
0.14495286 = queryWeight, product of:
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.044416238 = queryNorm
0.36057037 = fieldWeight in 1103, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.078125 = fieldNorm(doc=1103)
0.06553978 = weight(_text_:computer in 1103) [ClassicSimilarity], result of:
0.06553978 = score(doc=1103,freq=2.0), product of:
0.16231956 = queryWeight, product of:
3.6545093 = idf(docFreq=3109, maxDocs=44218)
0.044416238 = queryNorm
0.40377006 = fieldWeight in 1103, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.6545093 = idf(docFreq=3109, maxDocs=44218)
0.078125 = fieldNorm(doc=1103)
0.33333334 = coord(2/6)
- Abstract
- This article presents our exploration of computer science clustering algorithms as they relate to the Scorpion system. Scorpion is a research project at OCLC that explores the indexing and cataloging of electronic resources. For a more complete description of the Scorpion, please visit the Scorpion Web site at <http://purl.oclc.org/scorpion>
-
Search Engines and Beyond : Developing efficient knowledge management systems, April 19-20 1999, Boston, Mass (1999)
0.02
0.019813985 = product of:
0.059441954 = sum of:
0.03853567 = weight(_text_:wide in 2596) [ClassicSimilarity], result of:
0.03853567 = score(doc=2596,freq=2.0), product of:
0.19679762 = queryWeight, product of:
4.4307585 = idf(docFreq=1430, maxDocs=44218)
0.044416238 = queryNorm
0.1958137 = fieldWeight in 2596, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.4307585 = idf(docFreq=1430, maxDocs=44218)
0.03125 = fieldNorm(doc=2596)
0.020906283 = weight(_text_:web in 2596) [ClassicSimilarity], result of:
0.020906283 = score(doc=2596,freq=2.0), product of:
0.14495286 = queryWeight, product of:
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.044416238 = queryNorm
0.14422815 = fieldWeight in 2596, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.03125 = fieldNorm(doc=2596)
0.33333334 = coord(2/6)
- 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
-
Dolin, R.; Agrawal, D.; El Abbadi, A.; Pearlman, J.: Using automated classification for summarizing and selecting heterogeneous information sources (1998)
0.02
0.017025404 = product of:
0.05107621 = sum of:
0.028901752 = weight(_text_:wide in 1253) [ClassicSimilarity], result of:
0.028901752 = score(doc=1253,freq=2.0), product of:
0.19679762 = queryWeight, product of:
4.4307585 = idf(docFreq=1430, maxDocs=44218)
0.044416238 = queryNorm
0.14686027 = fieldWeight in 1253, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.4307585 = idf(docFreq=1430, maxDocs=44218)
0.0234375 = fieldNorm(doc=1253)
0.02217446 = weight(_text_:web in 1253) [ClassicSimilarity], result of:
0.02217446 = score(doc=1253,freq=4.0), product of:
0.14495286 = queryWeight, product of:
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.044416238 = queryNorm
0.15297705 = fieldWeight in 1253, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.0234375 = fieldNorm(doc=1253)
0.33333334 = coord(2/6)
- 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.
-
Lindholm, J.; Schönthal, T.; Jansson , K.: Experiences of harvesting Web resources in engineering using automatic classification (2003)
0.01
0.012070249 = product of:
0.07242149 = sum of:
0.07242149 = weight(_text_:web in 4088) [ClassicSimilarity], result of:
0.07242149 = score(doc=4088,freq=6.0), product of:
0.14495286 = queryWeight, product of:
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.044416238 = queryNorm
0.49962097 = fieldWeight in 4088, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.0625 = fieldNorm(doc=4088)
0.16666667 = coord(1/6)
- Abstract
- Authors describe the background and the work involved in setting up Engine-e, a Web index that uses automatic classification as a mean for the selection of resources in Engineering. Considerations in offering a robot-generated Web index as a successor to a manually indexed quality-controlled subject gateway are also discussed
-
Chan, L.M.; Lin, X.; Zeng, M.: Structural and multilingual approaches to subject access on the Web (1999)
0.01
0.009855317 = product of:
0.059131898 = sum of:
0.059131898 = weight(_text_:web in 162) [ClassicSimilarity], result of:
0.059131898 = score(doc=162,freq=4.0), product of:
0.14495286 = queryWeight, product of:
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.044416238 = queryNorm
0.4079388 = fieldWeight in 162, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.0625 = fieldNorm(doc=162)
0.16666667 = coord(1/6)
- 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
-
Prabowo, R.; Jackson, M.; Burden, P.; Knoell, H.-D.: Ontology-based automatic classification for the Web pages : design, implementation and evaluation (2002)
0.01
0.009052687 = product of:
0.054316122 = sum of:
0.054316122 = weight(_text_:web in 3383) [ClassicSimilarity], result of:
0.054316122 = score(doc=3383,freq=6.0), product of:
0.14495286 = queryWeight, product of:
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.044416238 = queryNorm
0.37471575 = fieldWeight in 3383, 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=3383)
0.16666667 = coord(1/6)
- Abstract
- In recent years, we have witnessed the continual growth in the use of ontologies in order to provide a mechanism to enable machine reasoning. This paper describes an automatic classifier, which focuses on the use of ontologies for classifying Web pages with respect to the Dewey Decimal Classification (DDC) and Library of Congress Classification (LCC) schemes. Firstly, we explain how these ontologies can be built in a modular fashion, and mapped into DDC and LCC. Secondly, we propose the formal definition of a DDC-LCC and an ontology-classification-scheme mapping. Thirdly, we explain the way the classifier uses these ontologies to assist classification. Finally, an experiment in which the accuracy of the classifier was evaluated is presented. The experiment shows that our approach results an improved classification in terms of accuracy. This improvement, however, comes at a cost in a low overage ratio due to the incompleteness of the ontologies used
- Content
- Beitrag bei: The Third International Conference on Web Information Systems Engineering (WISE'00) Dec., 12-14, 2002, Singapore, S.182.
-
Koch, T.; Vizine-Goetz, D.: Automatic classification and content navigation support for Web services : DESIRE II cooperates with OCLC (1998)
0.01
0.0060976665 = product of:
0.036585998 = sum of:
0.036585998 = weight(_text_:web in 1568) [ClassicSimilarity], result of:
0.036585998 = score(doc=1568,freq=2.0), product of:
0.14495286 = queryWeight, product of:
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.044416238 = queryNorm
0.25239927 = fieldWeight in 1568, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.0546875 = fieldNorm(doc=1568)
0.16666667 = coord(1/6)
-
Adams, K.C.: Word wranglers : Automatic classification tools transform enterprise documents from "bags of words" into knowledge resources (2003)
0.01
0.005461648 = product of:
0.03276989 = sum of:
0.03276989 = weight(_text_:computer in 1665) [ClassicSimilarity], result of:
0.03276989 = score(doc=1665,freq=2.0), product of:
0.16231956 = queryWeight, product of:
3.6545093 = idf(docFreq=3109, maxDocs=44218)
0.044416238 = queryNorm
0.20188503 = fieldWeight in 1665, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.6545093 = idf(docFreq=3109, maxDocs=44218)
0.0390625 = fieldNorm(doc=1665)
0.16666667 = coord(1/6)
- Abstract
- Taxonomies are an important part of any knowledge management (KM) system, and automatic classification software is emerging as a "killer app" for consumer and enterprise portals. A number of companies such as Inxight Software , Mohomine, Metacode, and others claim to interpret the semantic content of any textual document and automatically classify text on the fly. The promise that software could automatically produce a Yahoo-style directory is a siren call not many IT managers are able to resist. KM needs have grown more complex due to the increasing amount of digital information, the declining effectiveness of keyword searching, and heterogeneous document formats in corporate databases. This environment requires innovative KM tools, and automatic classification technology is an example of this new kind of software. These products can be divided into three categories according to their underlying technology - rules-based, catalog-by-example, and statistical clustering. Evolving trends in this market include framing classification as a cyborg (computer- and human-based) activity and the increasing use of extensible markup language (XML) and support vector machine (SVM) technology. In this article, we'll survey the rapidly changing automatic classification software market and examine the features and capabilities of leading classification products.
-
Dolin, R.; Agrawal, D.; El Abbadi, A.; Pearlman, J.: Using automated classification for summarizing and selecting heterogeneous information sources (1998)
0.01
0.0052265706 = product of:
0.031359423 = sum of:
0.031359423 = weight(_text_:web in 316) [ClassicSimilarity], result of:
0.031359423 = score(doc=316,freq=2.0), product of:
0.14495286 = queryWeight, product of:
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.044416238 = queryNorm
0.21634221 = fieldWeight in 316, 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=316)
0.16666667 = coord(1/6)
- 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).
-
Hagedorn, K.; Chapman, S.; Newman, D.: Enhancing search and browse using automated clustering of subject metadata (2007)
0.01
0.0052265706 = product of:
0.031359423 = sum of:
0.031359423 = weight(_text_:web in 1168) [ClassicSimilarity], result of:
0.031359423 = score(doc=1168,freq=2.0), product of:
0.14495286 = queryWeight, product of:
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.044416238 = queryNorm
0.21634221 = fieldWeight in 1168, 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=1168)
0.16666667 = coord(1/6)
- 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.
-
Reiner, U.: Automatische DDC-Klassifizierung von bibliografischen Titeldatensätzen (2009)
0.01
0.005014823 = product of:
0.030088935 = sum of:
0.030088935 = product of:
0.06017787 = sum of:
0.06017787 = weight(_text_:22 in 611) [ClassicSimilarity], result of:
0.06017787 = score(doc=611,freq=2.0), product of:
0.1555381 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.044416238 = 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)
0.16666667 = coord(1/6)
- Date
- 22. 8.2009 12:54:24
-
Automatic classification research at OCLC (2002)
0.00
0.003510376 = product of:
0.021062255 = sum of:
0.021062255 = product of:
0.04212451 = sum of:
0.04212451 = weight(_text_:22 in 1563) [ClassicSimilarity], result of:
0.04212451 = score(doc=1563,freq=2.0), product of:
0.1555381 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.044416238 = 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.16666667 = coord(1/6)
- Date
- 5. 5.2003 9:22:09
