-
Fuhr, N.: Ranking-Experimente mit gewichteter Indexierung (1986)
0.06
0.055229932 = product of:
0.1656898 = sum of:
0.1453788 = weight(_text_:ranking in 58) [ClassicSimilarity], result of:
0.1453788 = score(doc=58,freq=2.0), product of:
0.20271951 = queryWeight, product of:
5.4090285 = idf(docFreq=537, maxDocs=44218)
0.03747799 = queryNorm
0.71714264 = fieldWeight in 58, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
5.4090285 = idf(docFreq=537, maxDocs=44218)
0.09375 = fieldNorm(doc=58)
0.020311 = product of:
0.060932998 = sum of:
0.060932998 = weight(_text_:22 in 58) [ClassicSimilarity], result of:
0.060932998 = score(doc=58,freq=2.0), product of:
0.13124153 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.03747799 = queryNorm
0.46428138 = fieldWeight in 58, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.09375 = fieldNorm(doc=58)
0.33333334 = coord(1/3)
0.33333334 = coord(2/6)
- Date
- 14. 6.2015 22:12:44
-
Nohr, H.: Grundlagen der automatischen Indexierung : ein Lehrbuch (2003)
0.02
0.018409979 = product of:
0.055229932 = sum of:
0.0484596 = weight(_text_:ranking in 1767) [ClassicSimilarity], result of:
0.0484596 = score(doc=1767,freq=2.0), product of:
0.20271951 = queryWeight, product of:
5.4090285 = idf(docFreq=537, maxDocs=44218)
0.03747799 = queryNorm
0.23904754 = fieldWeight in 1767, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
5.4090285 = idf(docFreq=537, maxDocs=44218)
0.03125 = fieldNorm(doc=1767)
0.0067703333 = product of:
0.020311 = sum of:
0.020311 = weight(_text_:22 in 1767) [ClassicSimilarity], result of:
0.020311 = score(doc=1767,freq=2.0), product of:
0.13124153 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.03747799 = queryNorm
0.15476047 = fieldWeight in 1767, 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=1767)
0.33333334 = coord(1/3)
0.33333334 = coord(2/6)
- Date
- 22. 6.2009 12:46:51
- Footnote
- Im fünften Kapitel "Information Extraction" geht Nohr auf eine Problemstellung ein, die in der Fachwelt eine noch stärkere Betonung verdiente: "Die stetig ansteigende Zahl elektronischer Dokumente macht neben einer automatischen Erschließung auch eine automatische Gewinnung der relevanten Informationen aus diesen Dokumenten wünschenswert, um diese z.B. für weitere Bearbeitungen oder Auswertungen in betriebliche Informationssysteme übernehmen zu können." (S. 103) "Indexierung und Retrievalverfahren" als voneinander abhängige Verfahren werden im sechsten Kapitel behandelt. Hier stehen Relevance Ranking und Relevance Feedback sowie die Anwendung informationslinguistischer Verfahren in der Recherche im Mittelpunkt. Die "Evaluation automatischer Indexierung" setzt den thematischen Schlusspunkt. Hier geht es vor allem um die Oualität einer Indexierung, um gängige Retrievalmaße in Retrievaltest und deren Einssatz. Weiterhin ist hervorzuheben, dass jedes Kapitel durch die Vorgabe von Lernzielen eingeleitet wird und zu den jeweiligen Kapiteln (im hinteren Teil des Buches) einige Kontrollfragen gestellt werden. Die sehr zahlreichen Beispiele aus der Praxis, ein Abkürzungsverzeichnis und ein Sachregister erhöhen den Nutzwert des Buches. Die Lektüre förderte beim Rezensenten das Verständnis für die Zusammenhänge von BID-Handwerkzeug, Wirtschaftsinformatik (insbesondere Data Warehousing) und Künstlicher Intelligenz. Die "Grundlagen der automatischen Indexierung" sollte auch in den bibliothekarischen Studiengängen zur Pflichtlektüre gehören. Holger Nohrs Lehrbuch ist auch für den BID-Profi geeignet, um die mehr oder weniger fundierten Kenntnisse auf dem Gebiet "automatisches Indexieren" schnell, leicht verständlich und informativ aufzufrischen."
-
Jones, S.; Paynter, G.W.: Automatic extractionof document keyphrases for use in digital libraries : evaluations and applications (2002)
0.01
0.014277548 = product of:
0.085665286 = sum of:
0.085665286 = weight(_text_:ranking in 601) [ClassicSimilarity], result of:
0.085665286 = score(doc=601,freq=4.0), product of:
0.20271951 = queryWeight, product of:
5.4090285 = idf(docFreq=537, maxDocs=44218)
0.03747799 = queryNorm
0.42258036 = fieldWeight in 601, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
5.4090285 = idf(docFreq=537, maxDocs=44218)
0.0390625 = fieldNorm(doc=601)
0.16666667 = coord(1/6)
- Abstract
- This article describes an evaluation of the Kea automatic keyphrase extraction algorithm. Document keyphrases are conventionally used as concise descriptors of document content, and are increasingly used in novel ways, including document clustering, searching and browsing interfaces, and retrieval engines. However, it is costly and time consuming to manually assign keyphrases to documents, motivating the development of tools that automatically perform this function. Previous studies have evaluated Kea's performance by measuring its ability to identify author keywords and keyphrases, but this methodology has a number of well-known limitations. The results presented in this article are based on evaluations by human assessors of the quality and appropriateness of Kea keyphrases. The results indicate that, in general, Kea produces keyphrases that are rated positively by human assessors. However, typical Kea settings can degrade performance, particularly those relating to keyphrase length and domain specificity. We found that for some settings, Kea's performance is better than that of similar systems, and that Kea's ranking of extracted keyphrases is effective. We also determined that author-specified keyphrases appear to exhibit an inherent ranking, and that they are rated highly and therefore suitable for use in training and evaluation of automatic keyphrasing systems.
-
Wolfram Language erkennt Bilder (2015)
0.01
0.013238294 = product of:
0.07942976 = sum of:
0.07942976 = weight(_text_:suchmaschine in 1872) [ClassicSimilarity], result of:
0.07942976 = score(doc=1872,freq=2.0), product of:
0.21191008 = queryWeight, product of:
5.6542544 = idf(docFreq=420, maxDocs=44218)
0.03747799 = queryNorm
0.37482765 = fieldWeight in 1872, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
5.6542544 = idf(docFreq=420, maxDocs=44218)
0.046875 = fieldNorm(doc=1872)
0.16666667 = coord(1/6)
- Abstract
- Wolfram Research hat seine Cloud-basierte Programmiersprache Wolfram Language um eine Funktion zur Bilderkennung erweitert. Der Hersteller des Computeralgebrasystems Mathematica und Betreiber der Wissens-Suchmaschine Wolfram Alpha hat seinem System die Erkennung von Bildern beigebracht. Mit der Funktion ImageIdentify bekommt man in Wolfram Language jetzt zu einem Bild eine symbolische Beschreibung des Inhalts, die sich in der Sprache danach sogar weiterverarbeiten lässt. Als Demo dieser Funktion dient die Website The Wolfram Language Image Identification Project: Dort kann man ein beliebiges Bild hochladen und sich das Ergebnis anschauen. Die Website speichert einen Thumbnail des hochgeladenen Bildes, sodass man einen Link zu der Ergebnisseite weitergeben kann. Wie so oft bei künstlicher Intelligenz sind die Ergebnisse manchmal lustig daneben, oft aber auch überraschend gut. Die Funktion arbeitet mit einem neuronalen Netz, das mit einigen -zig Millionen Bildern trainiert wurde und etwa 10.000 Objekte identifizieren kann.
-
Advances in intelligent retrieval: Proc. of a conference ... Wadham College, Oxford, 16.-17.4.1985 (1986)
0.01
0.0121149 = product of:
0.0726894 = sum of:
0.0726894 = weight(_text_:ranking in 1384) [ClassicSimilarity], result of:
0.0726894 = score(doc=1384,freq=2.0), product of:
0.20271951 = queryWeight, product of:
5.4090285 = idf(docFreq=537, maxDocs=44218)
0.03747799 = queryNorm
0.35857132 = fieldWeight in 1384, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
5.4090285 = idf(docFreq=537, maxDocs=44218)
0.046875 = fieldNorm(doc=1384)
0.16666667 = coord(1/6)
- Content
- Enthält die Beiträge: ADDIS, T.: Extended relational analysis: a design approach to knowledge-based systems; PARKINSON, D.: Supercomputers and non-numeric processing; McGREGOR, D.R. u. J.R. MALONE: An architectural approach to advances in information retrieval; ALLEN, M.J. u. O.S. HARRISON: Word processing and information retrieval: some practical problems; MURTAGH, F.: Clustering and nearest neighborhood searching; ENSER, P.G.B.: Experimenting with the automatic classification of books; TESKEY, N. u. Z. RAZAK: An analysis of ranking for free text retrieval systems; ZARRI, G.P.: Interactive information retrieval: an artificial intelligence approach to deal with biographical data; HANCOX, P. u. F. SMITH: A case system processor for the PRECIS indexing language; ROUAULT, J.: Linguistic methods in information retrieval systems; ARAGON-RAMIREZ, V. u. C.D. PAICE: Design of a system for the online elucidation of natural language search statements; BROOKS, H.M., P.J. DANIELS u. N.J. BELKIN: Problem descriptions and user models: developing an intelligent interface for document retrieval systems; BLACK, W.J., P. HARGREAVES u. P.B. MAYES: HEADS: a cataloguing advisory system; BELL, D.A.: An architecture for integrating data, knowledge, and information bases
-
Liu, G.Z.: Semantic vector space model : implementation and evaluation (1997)
0.01
0.0121149 = product of:
0.0726894 = sum of:
0.0726894 = weight(_text_:ranking in 161) [ClassicSimilarity], result of:
0.0726894 = score(doc=161,freq=2.0), product of:
0.20271951 = queryWeight, product of:
5.4090285 = idf(docFreq=537, maxDocs=44218)
0.03747799 = queryNorm
0.35857132 = fieldWeight in 161, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
5.4090285 = idf(docFreq=537, maxDocs=44218)
0.046875 = fieldNorm(doc=161)
0.16666667 = coord(1/6)
- Abstract
- Presents the Semantic Vector Space Model (SVSM), a text representation and searching technique based on the combination of Vector Space Model (VSM) with heuristic syntax parsing and distributed representation of semantic case structures. Both document and queries are represented as semantic matrices. A search mechanism is designed to compute the similarity between 2 semantic matrices to predict relevancy. A prototype system was built to implement this model by modifying the SMART system and using the Xerox Part of Speech tagged as the pre-processor of the indexing. The prototype system was used in an experimental study to evaluate this technique in terms of precision, recall, and effectiveness of relevance ranking. Results show that if documents and queries were too short, the technique was less effective than VSM. But with longer documents and queires, especially when original docuemtns were used as queries, the system based on this technique was found be performance better than SMART
-
MacDougall, S.: Rethinking indexing : the impact of the Internet (1996)
0.01
0.0121149 = product of:
0.0726894 = sum of:
0.0726894 = weight(_text_:ranking in 704) [ClassicSimilarity], result of:
0.0726894 = score(doc=704,freq=2.0), product of:
0.20271951 = queryWeight, product of:
5.4090285 = idf(docFreq=537, maxDocs=44218)
0.03747799 = queryNorm
0.35857132 = fieldWeight in 704, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
5.4090285 = idf(docFreq=537, maxDocs=44218)
0.046875 = fieldNorm(doc=704)
0.16666667 = coord(1/6)
- Abstract
- Considers the challenge to professional indexers posed by the Internet. Indexing and searching on the Internet appears to have a retrograde step, as well developed and efficient information retrieval techniques have been replaced by cruder techniques, involving automatic keyword indexing and frequency ranking, leading to large retrieval sets and low precision. This is made worse by the apparent acceptance of this poor perfromance by Internet users and the feeling, on the part of indexers, that they are being bypassed by the producers of these hyperlinked menus and search engines. Key issues are: how far 'human' indexing will still be required in the Internet environment; how indexing techniques will have to change to stay relevant; and the future role of indexers. The challenge facing indexers is to adapt their skills to suit the online environment and to convince publishers of the need for efficient indexes on the Internet
-
Mao, J.; Xu, W.; Yang, Y.; Wang, J.; Yuille, A.L.: Explain images with multimodal recurrent neural networks (2014)
0.01
0.0121149 = product of:
0.0726894 = sum of:
0.0726894 = weight(_text_:ranking in 1557) [ClassicSimilarity], result of:
0.0726894 = score(doc=1557,freq=2.0), product of:
0.20271951 = queryWeight, product of:
5.4090285 = idf(docFreq=537, maxDocs=44218)
0.03747799 = queryNorm
0.35857132 = fieldWeight in 1557, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
5.4090285 = idf(docFreq=537, maxDocs=44218)
0.046875 = fieldNorm(doc=1557)
0.16666667 = coord(1/6)
- Abstract
- In this paper, we present a multimodal Recurrent Neural Network (m-RNN) model for generating novel sentence descriptions to explain the content of images. It directly models the probability distribution of generating a word given previous words and the image. Image descriptions are generated by sampling from this distribution. The model consists of two sub-networks: a deep recurrent neural network for sentences and a deep convolutional network for images. These two sub-networks interact with each other in a multimodal layer to form the whole m-RNN model. The effectiveness of our model is validated on three benchmark datasets (IAPR TC-12 [8], Flickr 8K [28], and Flickr 30K [13]). Our model outperforms the state-of-the-art generative method. In addition, the m-RNN model can be applied to retrieval tasks for retrieving images or sentences, and achieves significant performance improvement over the state-of-the-art methods which directly optimize the ranking objective function for retrieval.
-
Karpathy, A.; Fei-Fei, L.: Deep visual-semantic alignments for generating image descriptions (2015)
0.01
0.0121149 = product of:
0.0726894 = sum of:
0.0726894 = weight(_text_:ranking in 1868) [ClassicSimilarity], result of:
0.0726894 = score(doc=1868,freq=2.0), product of:
0.20271951 = queryWeight, product of:
5.4090285 = idf(docFreq=537, maxDocs=44218)
0.03747799 = queryNorm
0.35857132 = fieldWeight in 1868, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
5.4090285 = idf(docFreq=537, maxDocs=44218)
0.046875 = fieldNorm(doc=1868)
0.16666667 = coord(1/6)
- Abstract
- We present a model that generates free-form natural language descriptions of image regions. Our model leverages datasets of images and their sentence descriptions to learn about the inter-modal correspondences between text and visual data. Our approach is based on a novel combination of Convolutional Neural Networks over image regions, bidirectional Recurrent Neural Networks over sentences, and a structured objective that aligns the two modalities through a multimodal embedding. We then describe a Recurrent Neural Network architecture that uses the inferred alignments to learn to generate novel descriptions of image regions. We demonstrate the effectiveness of our alignment model with ranking experiments on Flickr8K, Flickr30K and COCO datasets, where we substantially improve on the state of the art. We then show that the sentences created by our generative model outperform retrieval baselines on the three aforementioned datasets and a new dataset of region-level annotations.
-
Grün, S.: Mehrwortbegriffe und Latent Semantic Analysis : Bewertung automatisch extrahierter Mehrwortgruppen mit LSA (2017)
0.01
0.010095751 = product of:
0.0605745 = sum of:
0.0605745 = weight(_text_:ranking in 3954) [ClassicSimilarity], result of:
0.0605745 = score(doc=3954,freq=2.0), product of:
0.20271951 = queryWeight, product of:
5.4090285 = idf(docFreq=537, maxDocs=44218)
0.03747799 = queryNorm
0.29880944 = fieldWeight in 3954, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
5.4090285 = idf(docFreq=537, maxDocs=44218)
0.0390625 = fieldNorm(doc=3954)
0.16666667 = coord(1/6)
- Abstract
- Die vorliegende Studie untersucht das Potenzial von Mehrwortbegriffen für das Information Retrieval. Zielsetzung der Arbeit ist es, intellektuell positiv bewertete Kandidaten mithilfe des Latent Semantic Analysis (LSA) Verfahren höher zu gewichten, als negativ bewertete Kandidaten. Die positiven Kandidaten sollen demnach bei einem Ranking im Information Retrieval bevorzugt werden. Als Kollektion wurde eine Version der sozialwissenschaftlichen GIRT-Datenbank (German Indexing and Retrieval Testdatabase) eingesetzt. Um Kandidaten für Mehrwortbegriffe zu identifizieren wurde die automatische Indexierung Lingo verwendet. Die notwendigen Kernfunktionalitäten waren Lemmatisierung, Identifizierung von Komposita, algorithmische Mehrworterkennung sowie Gewichtung von Indextermen durch das LSA-Modell. Die durch Lingo erkannten und LSAgewichteten Mehrwortkandidaten wurden evaluiert. Zuerst wurde dazu eine intellektuelle Auswahl von positiven und negativen Mehrwortkandidaten vorgenommen. Im zweiten Schritt der Evaluierung erfolgte die Berechnung der Ausbeute, um den Anteil der positiven Mehrwortkandidaten zu erhalten. Im letzten Schritt der Evaluierung wurde auf der Basis der R-Precision berechnet, wie viele positiv bewerteten Mehrwortkandidaten es an der Stelle k des Rankings geschafft haben. Die Ausbeute der positiven Mehrwortkandidaten lag bei durchschnittlich ca. 39%, während die R-Precision einen Durchschnittswert von 54% erzielte. Das LSA-Modell erzielt ein ambivalentes Ergebnis mit positiver Tendenz.
-
Wolfekuhler, M.R.; Punch, W.F.: Finding salient features for personal Web pages categories (1997)
0.01
0.007934572 = product of:
0.047607433 = sum of:
0.047607433 = product of:
0.07141115 = sum of:
0.035866898 = weight(_text_:29 in 2673) [ClassicSimilarity], result of:
0.035866898 = score(doc=2673,freq=2.0), product of:
0.13183585 = queryWeight, product of:
3.5176873 = idf(docFreq=3565, maxDocs=44218)
0.03747799 = queryNorm
0.27205724 = fieldWeight in 2673, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5176873 = idf(docFreq=3565, maxDocs=44218)
0.0546875 = fieldNorm(doc=2673)
0.03554425 = weight(_text_:22 in 2673) [ClassicSimilarity], result of:
0.03554425 = score(doc=2673,freq=2.0), product of:
0.13124153 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.03747799 = queryNorm
0.2708308 = fieldWeight in 2673, 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=2673)
0.6666667 = coord(2/3)
0.16666667 = coord(1/6)
- Date
- 1. 8.1996 22:08:06
- Source
- Computer networks and ISDN systems. 29(1997) no.8, S.1147-1156
-
Franke-Maier, M.: Anforderungen an die Qualität der Inhaltserschließung im Spannungsfeld von intellektuell und automatisch erzeugten Metadaten (2018)
0.01
0.007934572 = product of:
0.047607433 = sum of:
0.047607433 = product of:
0.07141115 = sum of:
0.035866898 = weight(_text_:29 in 5344) [ClassicSimilarity], result of:
0.035866898 = score(doc=5344,freq=2.0), product of:
0.13183585 = queryWeight, product of:
3.5176873 = idf(docFreq=3565, maxDocs=44218)
0.03747799 = queryNorm
0.27205724 = fieldWeight in 5344, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5176873 = idf(docFreq=3565, maxDocs=44218)
0.0546875 = fieldNorm(doc=5344)
0.03554425 = weight(_text_:22 in 5344) [ClassicSimilarity], result of:
0.03554425 = score(doc=5344,freq=2.0), product of:
0.13124153 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.03747799 = queryNorm
0.2708308 = fieldWeight in 5344, 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=5344)
0.6666667 = coord(2/3)
0.16666667 = coord(1/6)
- Abstract
- Spätestens seit dem Deutschen Bibliothekartag 2018 hat sich die Diskussion zu den automatischen Verfahren der Inhaltserschließung der Deutschen Nationalbibliothek von einer politisch geführten Diskussion in eine Qualitätsdiskussion verwandelt. Der folgende Beitrag beschäftigt sich mit Fragen der Qualität von Inhaltserschließung in digitalen Zeiten, wo heterogene Erzeugnisse unterschiedlicher Verfahren aufeinandertreffen und versucht, wichtige Anforderungen an Qualität zu definieren. Dieser Tagungsbeitrag fasst die vom Autor als Impulse vorgetragenen Ideen beim Workshop der FAG "Erschließung und Informationsvermittlung" des GBV am 29. August 2018 in Kiel zusammen. Der Workshop fand im Rahmen der 22. Verbundkonferenz des GBV statt.
-
SIGIR'92 : Proceedings of the 15th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (1992)
0.01
0.0070670256 = product of:
0.042402152 = sum of:
0.042402152 = weight(_text_:ranking in 6671) [ClassicSimilarity], result of:
0.042402152 = score(doc=6671,freq=2.0), product of:
0.20271951 = queryWeight, product of:
5.4090285 = idf(docFreq=537, maxDocs=44218)
0.03747799 = queryNorm
0.2091666 = fieldWeight in 6671, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
5.4090285 = idf(docFreq=537, maxDocs=44218)
0.02734375 = fieldNorm(doc=6671)
0.16666667 = coord(1/6)
- Content
- HARMAN, D.: Relevance feedback revisited; AALBERSBERG, I.J.: Incremental relevance feedback; TAGUE-SUTCLIFFE, J.: Measuring the informativeness of a retrieval process; LEWIS, D.D.: An evaluation of phrasal and clustered representations on a text categorization task; BLOSSEVILLE, M.J., G. HÉBRAIL, M.G. MONTEIL u. N. PÉNOT: Automatic document classification: natural language processing, statistical analysis, and expert system techniques used together; MASAND, B., G. LINOFF u. D. WALTZ: Classifying news stories using memory based reasoning; KEEN, E.M.: Term position ranking: some new test results; CROUCH, C.J. u. B. YANG: Experiments in automatic statistical thesaurus construction; GREFENSTETTE, G.: Use of syntactic context to produce term association lists for text retrieval; ANICK, P.G. u. R.A. FLYNN: Versioning of full-text information retrieval system; BURKOWSKI, F.J.: Retrieval activities in a database consisting of heterogeneous collections; DEERWESTER, S.C., K. WACLENA u. M. LaMAR: A textual object management system; NIE, J.-Y.:Towards a probabilistic modal logic for semantic-based information retrieval; WANG, A.W., S.K.M. WONG u. Y.Y. YAO: An analysis of vector space models based on computational geometry; BARTELL, B.T., G.W. COTTRELL u. R.K. BELEW: Latent semantic indexing is an optimal special case of multidimensional scaling; GLAVITSCH, U. u. P. SCHÄUBLE: A system for retrieving speech documents; MARGULIS, E.L.: N-Poisson document modelling; HESS, M.: An incrementally extensible document retrieval system based on linguistics and logical principles; COOPER, W.S., F.C. GEY u. D.P. DABNEY: Probabilistic retrieval based on staged logistic regression; FUHR, N.: Integration of probabilistic fact and text retrieval; CROFT, B., L.A. SMITH u. H. TURTLE: A loosely-coupled integration of a text retrieval system and an object-oriented database system; DUMAIS, S.T. u. J. NIELSEN: Automating the assignement of submitted manuscripts to reviewers; GOST, M.A. u. M. MASOTTI: Design of an OPAC database to permit different subject searching accesses; ROBERTSON, A.M. u. P. WILLETT: Searching for historical word forms in a database of 17th century English text using spelling correction methods; FAX, E.A., Q.F. CHEN u. L.S. HEATH: A faster algorithm for constructing minimal perfect hash functions; MOFFAT, A. u. J. ZOBEL: Parameterised compression for sparse bitmaps; GRANDI, F., P. TIBERIO u. P. Zezula: Frame-sliced patitioned parallel signature files; ALLEN, B.: Cognitive differences in end user searching of a CD-ROM index; SONNENWALD, D.H.: Developing a theory to guide the process of designing information retrieval systems; CUTTING, D.R., J.O. PEDERSEN, D. KARGER, u. J.W. TUKEY: Scatter/ Gather: a cluster-based approach to browsing large document collections; CHALMERS, M. u. P. CHITSON: Bead: Explorations in information visualization; WILLIAMSON, C. u. B. SHNEIDERMAN: The dynamic HomeFinder: evaluating dynamic queries in a real-estate information exploring system
-
Lohmann, H.: KASCADE: Dokumentanreicherung und automatische Inhaltserschließung : Projektbericht und Ergebnisse des Retrievaltests (2000)
0.01
0.0070670256 = product of:
0.042402152 = sum of:
0.042402152 = weight(_text_:ranking in 494) [ClassicSimilarity], result of:
0.042402152 = score(doc=494,freq=2.0), product of:
0.20271951 = queryWeight, product of:
5.4090285 = idf(docFreq=537, maxDocs=44218)
0.03747799 = queryNorm
0.2091666 = fieldWeight in 494, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
5.4090285 = idf(docFreq=537, maxDocs=44218)
0.02734375 = fieldNorm(doc=494)
0.16666667 = coord(1/6)
- Abstract
- Da sich mit jedem Dokument, das zu dem im Gewichtungsverfahren befindlichen Gesamtbestand hinzukommt, die Werte aller bereits gewichteten Deskriptoren ändern können, müsste die Berechnung der Häufigkeitsverteilung jeder Grundform im Prinzip nach jeder Änderung im Dokumentbestand neu berechnet werden. Eine Online-Aktualisierung des Bestandes erscheint daher wenig sinnvoll. In der Praxis könnte eine Neuberechnung in bestimmten zeitlichen Abständen mit einem Abzug des OPAC-Bestandes unabhängig vom eigentlichen Betrieb des OPAC erfolgen, was auch insofern genügen würde, als die zugrunde liegenden Maße auf relativen Häufigkeiten basieren. Dadurch würde nur ein geringer Verzug in der Bereitstellung der aktuellen Gewichte eintreten. Außerdem würde der Zeitfaktor eine nur untergeordnete Rolle spielen, da ein offline ablaufender Gewichtungslauf erst bis zum nächsten Aktualisierungszeitpunkt abgeschlossen sein müsste. Denkbar wäre zusätzlich, für die Zeit zwischen zwei Aktualisierungen des OPACs für die in den Neuzugängen enthaltenen Begriffe Standardgewichte einzusetzen, soweit diese Begriffe bereits in dem Bestand auftreten. Bei entsprechender Optimierung und Rationalisierung der SELIX-Verfahrensabläufe, Nutzung der Gewichte auf der Retrievalseite für ein Ranking der auszugebenden Dokumente und Integration der THEAS-Komponente kann das Verfahren zu einem wirkungsvollen Instrument zur Verbesserung der Retrievaleffektivität weiterentwickelt werden.
-
Kuhlen, R.: Morphologische Relationen durch Reduktionsalgorithmen (1974)
0.01
0.0056359395 = product of:
0.033815637 = sum of:
0.033815637 = product of:
0.10144691 = sum of:
0.10144691 = weight(_text_:29 in 4251) [ClassicSimilarity], result of:
0.10144691 = score(doc=4251,freq=4.0), product of:
0.13183585 = queryWeight, product of:
3.5176873 = idf(docFreq=3565, maxDocs=44218)
0.03747799 = queryNorm
0.7694941 = fieldWeight in 4251, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.5176873 = idf(docFreq=3565, maxDocs=44218)
0.109375 = fieldNorm(doc=4251)
0.33333334 = coord(1/3)
0.16666667 = coord(1/6)
- Date
- 29. 1.2011 14:56:29
-
Panyr, J.: STEINADLER: ein Verfahren zur automatischen Deskribierung und zur automatischen thematischen Klassifikation (1978)
0.00
0.004554527 = product of:
0.027327161 = sum of:
0.027327161 = product of:
0.08198148 = sum of:
0.08198148 = weight(_text_:29 in 5169) [ClassicSimilarity], result of:
0.08198148 = score(doc=5169,freq=2.0), product of:
0.13183585 = queryWeight, product of:
3.5176873 = idf(docFreq=3565, maxDocs=44218)
0.03747799 = queryNorm
0.6218451 = fieldWeight in 5169, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5176873 = idf(docFreq=3565, maxDocs=44218)
0.125 = fieldNorm(doc=5169)
0.33333334 = coord(1/3)
0.16666667 = coord(1/6)
- Source
- Nachrichten für Dokumentation. 29(1978), S.92-96
-
Salton, G.; Yang, C.S.: On the specification of term values in automatic indexing (1973)
0.00
0.004554527 = product of:
0.027327161 = sum of:
0.027327161 = product of:
0.08198148 = sum of:
0.08198148 = weight(_text_:29 in 5476) [ClassicSimilarity], result of:
0.08198148 = score(doc=5476,freq=2.0), product of:
0.13183585 = queryWeight, product of:
3.5176873 = idf(docFreq=3565, maxDocs=44218)
0.03747799 = queryNorm
0.6218451 = fieldWeight in 5476, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5176873 = idf(docFreq=3565, maxDocs=44218)
0.125 = fieldNorm(doc=5476)
0.33333334 = coord(1/3)
0.16666667 = coord(1/6)
- Source
- Journal of documentation. 29(1973), S.351-372
-
Voorhees, E.M.: Implementing agglomerative hierarchic clustering algorithms for use in document retrieval (1986)
0.00
0.0045135557 = product of:
0.027081333 = sum of:
0.027081333 = product of:
0.081244 = sum of:
0.081244 = weight(_text_:22 in 402) [ClassicSimilarity], result of:
0.081244 = score(doc=402,freq=2.0), product of:
0.13124153 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.03747799 = queryNorm
0.61904186 = fieldWeight in 402, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.125 = fieldNorm(doc=402)
0.33333334 = coord(1/3)
0.16666667 = coord(1/6)
- Source
- Information processing and management. 22(1986) no.6, S.465-476
-
Fuhr, N.; Niewelt, B.: ¬Ein Retrievaltest mit automatisch indexierten Dokumenten (1984)
0.00
0.0039493614 = product of:
0.023696167 = sum of:
0.023696167 = product of:
0.0710885 = sum of:
0.0710885 = weight(_text_:22 in 262) [ClassicSimilarity], result of:
0.0710885 = score(doc=262,freq=2.0), product of:
0.13124153 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.03747799 = queryNorm
0.5416616 = fieldWeight in 262, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.109375 = fieldNorm(doc=262)
0.33333334 = coord(1/3)
0.16666667 = coord(1/6)
- Date
- 20.10.2000 12:22:23
-
Hlava, M.M.K.: Automatic indexing : comparing rule-based and statistics-based indexing systems (2005)
0.00
0.0039493614 = product of:
0.023696167 = sum of:
0.023696167 = product of:
0.0710885 = sum of:
0.0710885 = weight(_text_:22 in 6265) [ClassicSimilarity], result of:
0.0710885 = score(doc=6265,freq=2.0), product of:
0.13124153 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.03747799 = queryNorm
0.5416616 = fieldWeight in 6265, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.109375 = fieldNorm(doc=6265)
0.33333334 = coord(1/3)
0.16666667 = coord(1/6)
- Source
- Information outlook. 9(2005) no.8, S.22-23
