-
Voorhees, E.M.: Implementing agglomerative hierarchic clustering algorithms for use in document retrieval (1986)
0.06
0.059291773 = product of:
0.23716709 = sum of:
0.23716709 = sum of:
0.13565561 = weight(_text_:processing in 402) [ClassicSimilarity], result of:
0.13565561 = score(doc=402,freq=2.0), product of:
0.18956426 = queryWeight, product of:
4.048147 = idf(docFreq=2097, maxDocs=44218)
0.046827413 = queryNorm
0.7156181 = fieldWeight in 402, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.048147 = idf(docFreq=2097, maxDocs=44218)
0.125 = fieldNorm(doc=402)
0.101511486 = weight(_text_:22 in 402) [ClassicSimilarity], result of:
0.101511486 = score(doc=402,freq=2.0), product of:
0.16398162 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.046827413 = 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.25 = coord(1/4)
- Source
- Information processing and management. 22(1986) no.6, S.465-476
-
Milstead, J.L.: Thesauri in a full-text world (1998)
0.05
0.049989868 = product of:
0.099979736 = sum of:
0.02586502 = weight(_text_:data in 2337) [ClassicSimilarity], result of:
0.02586502 = score(doc=2337,freq=2.0), product of:
0.14807065 = queryWeight, product of:
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.046827413 = queryNorm
0.17468026 = fieldWeight in 2337, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.0390625 = fieldNorm(doc=2337)
0.07411472 = sum of:
0.042392377 = weight(_text_:processing in 2337) [ClassicSimilarity], result of:
0.042392377 = score(doc=2337,freq=2.0), product of:
0.18956426 = queryWeight, product of:
4.048147 = idf(docFreq=2097, maxDocs=44218)
0.046827413 = queryNorm
0.22363065 = fieldWeight in 2337, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.048147 = idf(docFreq=2097, maxDocs=44218)
0.0390625 = fieldNorm(doc=2337)
0.03172234 = weight(_text_:22 in 2337) [ClassicSimilarity], result of:
0.03172234 = score(doc=2337,freq=2.0), product of:
0.16398162 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.046827413 = queryNorm
0.19345059 = fieldWeight in 2337, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.0390625 = fieldNorm(doc=2337)
0.5 = coord(2/4)
- Date
- 22. 9.1997 19:16:05
- Source
- Visualizing subject access for 21st century information resources: Papers presented at the 1997 Clinic on Library Applications of Data Processing, 2-4 Mar 1997, Graduate School of Library and Information Science, University of Illinois at Urbana-Champaign. Ed.: P.A. Cochrane et al
-
Fox, C.: Lexical analysis and stoplists (1992)
0.05
0.046219878 = product of:
0.092439756 = sum of:
0.058525857 = weight(_text_:data in 3502) [ClassicSimilarity], result of:
0.058525857 = score(doc=3502,freq=4.0), product of:
0.14807065 = queryWeight, product of:
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.046827413 = queryNorm
0.3952563 = fieldWeight in 3502, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.0625 = fieldNorm(doc=3502)
0.033913903 = product of:
0.067827806 = sum of:
0.067827806 = weight(_text_:processing in 3502) [ClassicSimilarity], result of:
0.067827806 = score(doc=3502,freq=2.0), product of:
0.18956426 = queryWeight, product of:
4.048147 = idf(docFreq=2097, maxDocs=44218)
0.046827413 = queryNorm
0.35780904 = fieldWeight in 3502, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.048147 = idf(docFreq=2097, maxDocs=44218)
0.0625 = fieldNorm(doc=3502)
0.5 = coord(1/2)
0.5 = coord(2/4)
- Abstract
- Lexical analysis is a fundamental operation in both query processing and automatic indexing, and filtering stoplist words is an important step in the automatic indexing process. Presents basic algorithms and data structures for lexical analysis, and shows how stoplist word removal can be efficiently incorporated into lexical analysis
- Source
- Information retrieval: data structures and algorithms. Ed.: W.B. Frakes u. R. Baeza-Yates
-
Stankovic, R. et al.: Indexing of textual databases based on lexical resources : a case study for Serbian (2016)
0.04
0.04172619 = product of:
0.08345238 = sum of:
0.05173004 = weight(_text_:data in 2759) [ClassicSimilarity], result of:
0.05173004 = score(doc=2759,freq=2.0), product of:
0.14807065 = queryWeight, product of:
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.046827413 = queryNorm
0.34936053 = fieldWeight in 2759, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.078125 = fieldNorm(doc=2759)
0.03172234 = product of:
0.06344468 = sum of:
0.06344468 = weight(_text_:22 in 2759) [ClassicSimilarity], result of:
0.06344468 = score(doc=2759,freq=2.0), product of:
0.16398162 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.046827413 = queryNorm
0.38690117 = fieldWeight in 2759, 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=2759)
0.5 = coord(1/2)
0.5 = coord(2/4)
- Date
- 1. 2.2016 18:25:22
- Source
- Semantic keyword-based search on structured data sources: First COST Action IC1302 International KEYSTONE Conference, IKC 2015, Coimbra, Portugal, September 8-9, 2015. Revised Selected Papers. Eds.: J. Cardoso et al
-
Milstead, J.L.: Methodologies for subject analysis in bibliographic databases (1992)
0.04
0.040442396 = product of:
0.08088479 = sum of:
0.051210128 = weight(_text_:data in 2311) [ClassicSimilarity], result of:
0.051210128 = score(doc=2311,freq=4.0), product of:
0.14807065 = queryWeight, product of:
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.046827413 = queryNorm
0.34584928 = fieldWeight in 2311, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.0546875 = fieldNorm(doc=2311)
0.029674664 = product of:
0.05934933 = sum of:
0.05934933 = weight(_text_:processing in 2311) [ClassicSimilarity], result of:
0.05934933 = score(doc=2311,freq=2.0), product of:
0.18956426 = queryWeight, product of:
4.048147 = idf(docFreq=2097, maxDocs=44218)
0.046827413 = queryNorm
0.3130829 = fieldWeight in 2311, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.048147 = idf(docFreq=2097, maxDocs=44218)
0.0546875 = fieldNorm(doc=2311)
0.5 = coord(1/2)
0.5 = coord(2/4)
- Abstract
- The goal of the study was to determine the state of the art of subject analysis as applied to large bibliographic data bases. The intent was to gather and evaluate information, casting it in a form that could be applied by management. There was no attempt to determine actual costs or trade-offs among costs and possible benefits. Commercial automatic indexing packages were also reviewed. The overall conclusion was that data base producers should begin working seriously on upgrading their thesauri and codifying their indexing policies as a means of moving toward development of machine aids to indexing, but that fully automatic indexing is not yet ready for wholesale implementation
- Source
- Information processing and management. 28(1992) no.3, S.407-431
-
Advances in intelligent retrieval: Proc. of a conference ... Wadham College, Oxford, 16.-17.4.1985 (1986)
0.04
0.03993276 = product of:
0.07986552 = sum of:
0.043894395 = weight(_text_:data in 1384) [ClassicSimilarity], result of:
0.043894395 = score(doc=1384,freq=4.0), product of:
0.14807065 = queryWeight, product of:
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.046827413 = queryNorm
0.29644224 = fieldWeight in 1384, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.046875 = fieldNorm(doc=1384)
0.035971127 = product of:
0.071942255 = sum of:
0.071942255 = weight(_text_:processing in 1384) [ClassicSimilarity], result of:
0.071942255 = score(doc=1384,freq=4.0), product of:
0.18956426 = queryWeight, product of:
4.048147 = idf(docFreq=2097, maxDocs=44218)
0.046827413 = queryNorm
0.3795138 = fieldWeight in 1384, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
4.048147 = idf(docFreq=2097, maxDocs=44218)
0.046875 = fieldNorm(doc=1384)
0.5 = coord(1/2)
0.5 = coord(2/4)
- 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
-
Wolfe, EW.: a case study in automated metadata enhancement : Natural Language Processing in the humanities (2019)
0.04
0.03908867 = product of:
0.07817734 = sum of:
0.036211025 = weight(_text_:data in 5236) [ClassicSimilarity], result of:
0.036211025 = score(doc=5236,freq=2.0), product of:
0.14807065 = queryWeight, product of:
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.046827413 = queryNorm
0.24455236 = fieldWeight in 5236, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.0546875 = fieldNorm(doc=5236)
0.041966315 = product of:
0.08393263 = sum of:
0.08393263 = weight(_text_:processing in 5236) [ClassicSimilarity], result of:
0.08393263 = score(doc=5236,freq=4.0), product of:
0.18956426 = queryWeight, product of:
4.048147 = idf(docFreq=2097, maxDocs=44218)
0.046827413 = queryNorm
0.4427661 = fieldWeight in 5236, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
4.048147 = idf(docFreq=2097, maxDocs=44218)
0.0546875 = fieldNorm(doc=5236)
0.5 = coord(1/2)
0.5 = coord(2/4)
- Abstract
- The Black Book Interactive Project at the University of Kansas (KU) is developing an expanded corpus of novels by African American authors, with an emphasis on lesser known writers and a goal of expanding research in this field. Using a custom metadata schema with an emphasis on race-related elements, each novel is analyzed for a variety of elements such as literary style, targeted content analysis, historical context, and other areas. Librarians at KU have worked to develop a variety of computational text analysis processes designed to assist with specific aspects of this metadata collection, including text mining and natural language processing, automated subject extraction based on word sense disambiguation, harvesting data from Wikidata, and other actions.
-
Polity, Y.: Vers une ergonomie linguistique (1994)
0.04
0.03764897 = product of:
0.07529794 = sum of:
0.04138403 = weight(_text_:data in 36) [ClassicSimilarity], result of:
0.04138403 = score(doc=36,freq=2.0), product of:
0.14807065 = queryWeight, product of:
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.046827413 = queryNorm
0.2794884 = fieldWeight in 36, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.0625 = fieldNorm(doc=36)
0.033913903 = product of:
0.067827806 = sum of:
0.067827806 = weight(_text_:processing in 36) [ClassicSimilarity], result of:
0.067827806 = score(doc=36,freq=2.0), product of:
0.18956426 = queryWeight, product of:
4.048147 = idf(docFreq=2097, maxDocs=44218)
0.046827413 = queryNorm
0.35780904 = fieldWeight in 36, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.048147 = idf(docFreq=2097, maxDocs=44218)
0.0625 = fieldNorm(doc=36)
0.5 = coord(1/2)
0.5 = coord(2/4)
- Abstract
- Analyzed a special type of man-mchine interaction, that of searching an information system with natural language. A model for full text processing for information retrieval was proposed that considered the system's users and how they employ information. Describes how INIST (the National Institute for Scientific and Technical Information) is developing computer assisted indexing as an aid to improving relevance when retrieving information from bibliographic data banks
-
Driscoll, J.R.; Rajala, D.A.; Shaffer, W.H.: ¬The operation and performance of an artificially intelligent keywording system (1991)
0.03
0.032942846 = product of:
0.06588569 = sum of:
0.036211025 = weight(_text_:data in 6681) [ClassicSimilarity], result of:
0.036211025 = score(doc=6681,freq=2.0), product of:
0.14807065 = queryWeight, product of:
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.046827413 = queryNorm
0.24455236 = fieldWeight in 6681, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.0546875 = fieldNorm(doc=6681)
0.029674664 = product of:
0.05934933 = sum of:
0.05934933 = weight(_text_:processing in 6681) [ClassicSimilarity], result of:
0.05934933 = score(doc=6681,freq=2.0), product of:
0.18956426 = queryWeight, product of:
4.048147 = idf(docFreq=2097, maxDocs=44218)
0.046827413 = queryNorm
0.3130829 = fieldWeight in 6681, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.048147 = idf(docFreq=2097, maxDocs=44218)
0.0546875 = fieldNorm(doc=6681)
0.5 = coord(1/2)
0.5 = coord(2/4)
- Abstract
- Presents a new approach to text analysis for automating the key phrase indexing process, using artificial intelligence techniques. This mimics the behaviour of human experts by using a rule base consisting of insertion and deletion rules generated by subject-matter experts. The insertion rules are based on the idea that some phrases found in a text imply or trigger other phrases. The deletion rules apply to semantically ambiguous phrases where text presence alone does not determine appropriateness as a key phrase. The insertion and deletion rules are used to transform a list of found phrases to a list of key phrases for indexing a document. Statistical data are provided to demonstrate the performance of this expert rule based system
- Source
- Information processing and management. 27(1991) no.1, S.43-54
-
Bordoni, L.; Pazienza, M.T.: Documents automatic indexing in an environmental domain (1997)
0.03
0.032085977 = product of:
0.12834391 = sum of:
0.12834391 = sum of:
0.08393263 = weight(_text_:processing in 530) [ClassicSimilarity], result of:
0.08393263 = score(doc=530,freq=4.0), product of:
0.18956426 = queryWeight, product of:
4.048147 = idf(docFreq=2097, maxDocs=44218)
0.046827413 = queryNorm
0.4427661 = fieldWeight in 530, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
4.048147 = idf(docFreq=2097, maxDocs=44218)
0.0546875 = fieldNorm(doc=530)
0.044411276 = weight(_text_:22 in 530) [ClassicSimilarity], result of:
0.044411276 = score(doc=530,freq=2.0), product of:
0.16398162 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.046827413 = queryNorm
0.2708308 = fieldWeight in 530, 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=530)
0.25 = coord(1/4)
- Abstract
- Describes an application of Natural Language Processing (NLP) techniques, in HIRMA (Hypertextual Information Retrieval Managed by ARIOSTO), to the problem of document indexing by referring to a system which incorporates natural language processing techniques to determine the subject of the text of documents and to associate them with relevant semantic indexes. Describes briefly the overall system, details of its implementation on a corpus of scientific abstracts related to environmental topics and experimental evidence of the system's behaviour. Analyzes in detail an experiment designed to evaluate the system's retrieval ability in terms of recall and precision
- Source
- International forum on information and documentation. 22(1997) no.1, S.17-28
-
Mongin, L.; Fu, Y.Y.; Mostafa, J.: Open Archives data Service prototype and automated subject indexing using D-Lib archive content as a testbed (2003)
0.03
0.028236724 = product of:
0.05647345 = sum of:
0.031038022 = weight(_text_:data in 1167) [ClassicSimilarity], result of:
0.031038022 = score(doc=1167,freq=2.0), product of:
0.14807065 = queryWeight, product of:
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.046827413 = queryNorm
0.2096163 = fieldWeight in 1167, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.046875 = fieldNorm(doc=1167)
0.025435425 = product of:
0.05087085 = sum of:
0.05087085 = weight(_text_:processing in 1167) [ClassicSimilarity], result of:
0.05087085 = score(doc=1167,freq=2.0), product of:
0.18956426 = queryWeight, product of:
4.048147 = idf(docFreq=2097, maxDocs=44218)
0.046827413 = queryNorm
0.26835677 = fieldWeight in 1167, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.048147 = idf(docFreq=2097, maxDocs=44218)
0.046875 = fieldNorm(doc=1167)
0.5 = coord(1/2)
0.5 = coord(2/4)
- Abstract
- The Indiana University School of Library and Information Science opened a new research laboratory in January 2003; The Indiana University School of Library and Information Science Information Processing Laboratory [IU IP Lab]. The purpose of the new laboratory is to facilitate collaboration between scientists in the department in the areas of information retrieval (IR) and information visualization (IV) research. The lab has several areas of focus. These include grid and cluster computing, and a standard Java-based software platform to support plug and play research datasets, a selection of standard IR modules and standard IV algorithms. Future development includes software to enable researchers to contribute datasets, IR algorithms, and visualization algorithms into the standard environment. We decided early on to use OAI-PMH as a resource discovery tool because it is consistent with our mission.
-
Donahue, J.; Hendricks, L.A.; Guadarrama, S.; Rohrbach, M.; Venugopalan, S.; Saenko, K.; Darrell, T.: Long-term recurrent convolutional networks for visual recognition and description (2014)
0.02
0.023530604 = product of:
0.04706121 = sum of:
0.02586502 = weight(_text_:data in 1873) [ClassicSimilarity], result of:
0.02586502 = score(doc=1873,freq=2.0), product of:
0.14807065 = queryWeight, product of:
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.046827413 = queryNorm
0.17468026 = fieldWeight in 1873, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.0390625 = fieldNorm(doc=1873)
0.021196188 = product of:
0.042392377 = sum of:
0.042392377 = weight(_text_:processing in 1873) [ClassicSimilarity], result of:
0.042392377 = score(doc=1873,freq=2.0), product of:
0.18956426 = queryWeight, product of:
4.048147 = idf(docFreq=2097, maxDocs=44218)
0.046827413 = queryNorm
0.22363065 = fieldWeight in 1873, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.048147 = idf(docFreq=2097, maxDocs=44218)
0.0390625 = fieldNorm(doc=1873)
0.5 = coord(1/2)
0.5 = coord(2/4)
- Abstract
- Models based on deep convolutional networks have dominated recent image interpretation tasks; we investigate whether models which are also recurrent, or "temporally deep", are effective for tasks involving sequences, visual and otherwise. We develop a novel recurrent convolutional architecture suitable for large-scale visual learning which is end-to-end trainable, and demonstrate the value of these models on benchmark video recognition tasks, image description and retrieval problems, and video narration challenges. In contrast to current models which assume a fixed spatio-temporal receptive field or simple temporal averaging for sequential processing, recurrent convolutional models are "doubly deep" in that they can be compositional in spatial and temporal "layers". Such models may have advantages when target concepts are complex and/or training data are limited. Learning long-term dependencies is possible when nonlinearities are incorporated into the network state updates. Long-term RNN models are appealing in that they directly can map variable-length inputs (e.g., video frames) to variable length outputs (e.g., natural language text) and can model complex temporal dynamics; yet they can be optimized with backpropagation. Our recurrent long-term models are directly connected to modern visual convnet models and can be jointly trained to simultaneously learn temporal dynamics and convolutional perceptual representations. Our results show such models have distinct advantages over state-of-the-art models for recognition or generation which are separately defined and/or optimized.
-
Li, X.; Zhang, A.; Li, C.; Ouyang, J.; Cai, Y.: Exploring coherent topics by topic modeling with term weighting (2018)
0.02
0.023530604 = product of:
0.04706121 = sum of:
0.02586502 = weight(_text_:data in 5045) [ClassicSimilarity], result of:
0.02586502 = score(doc=5045,freq=2.0), product of:
0.14807065 = queryWeight, product of:
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.046827413 = queryNorm
0.17468026 = fieldWeight in 5045, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.0390625 = fieldNorm(doc=5045)
0.021196188 = product of:
0.042392377 = sum of:
0.042392377 = weight(_text_:processing in 5045) [ClassicSimilarity], result of:
0.042392377 = score(doc=5045,freq=2.0), product of:
0.18956426 = queryWeight, product of:
4.048147 = idf(docFreq=2097, maxDocs=44218)
0.046827413 = queryNorm
0.22363065 = fieldWeight in 5045, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.048147 = idf(docFreq=2097, maxDocs=44218)
0.0390625 = fieldNorm(doc=5045)
0.5 = coord(1/2)
0.5 = coord(2/4)
- Abstract
- Topic models often produce unexplainable topics that are filled with noisy words. The reason is that words in topic modeling have equal weights. High frequency words dominate the top topic word lists, but most of them are meaningless words, e.g., domain-specific stopwords. To address this issue, in this paper we aim to investigate how to weight words, and then develop a straightforward but effective term weighting scheme, namely entropy weighting (EW). The proposed EW scheme is based on conditional entropy measured by word co-occurrences. Compared with existing term weighting schemes, the highlight of EW is that it can automatically reward informative words. For more robust word weight, we further suggest a combination form of EW (CEW) with two existing weighting schemes. Basically, our CEW assigns meaningless words lower weights and informative words higher weights, leading to more coherent topics during topic modeling inference. We apply CEW to Dirichlet multinomial mixture and latent Dirichlet allocation, and evaluate it by topic quality, document clustering and classification tasks on 8 real world data sets. Experimental results show that weighting words can effectively improve the topic modeling performance over both short texts and normal long texts. More importantly, the proposed CEW significantly outperforms the existing term weighting schemes, since it further considers which words are informative.
- Source
- Information processing and management. 54(2018) no.6, S.1345-1358
-
Junger, U.; Schwens, U.: ¬Die inhaltliche Erschließung des schriftlichen kulturellen Erbes auf dem Weg in die Zukunft : Automatische Vergabe von Schlagwörtern in der Deutschen Nationalbibliothek (2017)
0.02
0.020863095 = product of:
0.04172619 = sum of:
0.02586502 = weight(_text_:data in 3780) [ClassicSimilarity], result of:
0.02586502 = score(doc=3780,freq=2.0), product of:
0.14807065 = queryWeight, product of:
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.046827413 = queryNorm
0.17468026 = fieldWeight in 3780, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.0390625 = fieldNorm(doc=3780)
0.01586117 = product of:
0.03172234 = sum of:
0.03172234 = weight(_text_:22 in 3780) [ClassicSimilarity], result of:
0.03172234 = score(doc=3780,freq=2.0), product of:
0.16398162 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.046827413 = queryNorm
0.19345059 = fieldWeight in 3780, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.0390625 = fieldNorm(doc=3780)
0.5 = coord(1/2)
0.5 = coord(2/4)
- Abstract
- Wir leben im 21. Jahrhundert, und vieles, was vor hundert und noch vor fünfzig Jahren als Science Fiction abgetan worden wäre, ist mittlerweile Realität. Raumsonden fliegen zum Mars, machen dort Experimente und liefern Daten zur Erde zurück. Roboter werden für Routineaufgaben eingesetzt, zum Beispiel in der Industrie oder in der Medizin. Digitalisierung, künstliche Intelligenz und automatisierte Verfahren sind kaum mehr aus unserem Alltag wegzudenken. Grundlage vieler Prozesse sind lernende Algorithmen. Die fortschreitende digitale Transformation ist global und umfasst alle Lebens- und Arbeitsbereiche: Wirtschaft, Gesellschaft und Politik. Sie eröffnet neue Möglichkeiten, von denen auch Bibliotheken profitieren. Der starke Anstieg digitaler Publikationen, die einen wichtigen und prozentual immer größer werdenden Teil des Kulturerbes darstellen, sollte für Bibliotheken Anlass sein, diese Möglichkeiten aktiv aufzugreifen und einzusetzen. Die Auswertbarkeit digitaler Inhalte, beispielsweise durch Text- and Data-Mining (TDM), und die Entwicklung technischer Verfahren, mittels derer Inhalte miteinander vernetzt und semantisch in Beziehung gesetzt werden können, bieten Raum, auch bibliothekarische Erschließungsverfahren neu zu denken. Daher beschäftigt sich die Deutsche Nationalbibliothek (DNB) seit einigen Jahren mit der Frage, wie sich die Prozesse bei der Erschließung von Medienwerken verbessern und maschinell unterstützen lassen. Sie steht dabei im regelmäßigen kollegialen Austausch mit anderen Bibliotheken, die sich ebenfalls aktiv mit dieser Fragestellung befassen, sowie mit europäischen Nationalbibliotheken, die ihrerseits Interesse an dem Thema und den Erfahrungen der DNB haben. Als Nationalbibliothek mit umfangreichen Beständen an digitalen Publikationen hat die DNB auch Expertise bei der digitalen Langzeitarchivierung aufgebaut und ist im Netzwerk ihrer Partner als kompetente Gesprächspartnerin geschätzt.
- Date
- 19. 8.2017 9:24:22
-
Chowdhury, G.G.: Natural language processing and information retrieval : pt.1: basic issues; pt.2: major applications (1991)
0.02
0.018356439 = product of:
0.073425755 = sum of:
0.073425755 = product of:
0.14685151 = sum of:
0.14685151 = weight(_text_:processing in 3313) [ClassicSimilarity], result of:
0.14685151 = score(doc=3313,freq=6.0), product of:
0.18956426 = queryWeight, product of:
4.048147 = idf(docFreq=2097, maxDocs=44218)
0.046827413 = queryNorm
0.7746793 = fieldWeight in 3313, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
4.048147 = idf(docFreq=2097, maxDocs=44218)
0.078125 = fieldNorm(doc=3313)
0.5 = coord(1/2)
0.25 = coord(1/4)
- Abstract
- Reviews the basic issues and procedures involved in natural language processing of textual material for final use in information retrieval. Covers: natural language processing; natural language understanding; syntactic and semantic analysis; parsing; knowledge bases and knowledge representation
-
Martins, A.L.; Souza, R.R.; Ribeiro de Mello, H.: ¬The use of noun phrases in information retrieval : proposing a mechanism for automatic classification (2014)
0.02
0.018334843 = product of:
0.07333937 = sum of:
0.07333937 = sum of:
0.0479615 = weight(_text_:processing in 1441) [ClassicSimilarity], result of:
0.0479615 = score(doc=1441,freq=4.0), product of:
0.18956426 = queryWeight, product of:
4.048147 = idf(docFreq=2097, maxDocs=44218)
0.046827413 = queryNorm
0.2530092 = fieldWeight in 1441, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
4.048147 = idf(docFreq=2097, maxDocs=44218)
0.03125 = fieldNorm(doc=1441)
0.025377871 = weight(_text_:22 in 1441) [ClassicSimilarity], result of:
0.025377871 = score(doc=1441,freq=2.0), product of:
0.16398162 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.046827413 = queryNorm
0.15476047 = fieldWeight in 1441, 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=1441)
0.25 = coord(1/4)
- Abstract
- This paper presents a research on syntactic structures known as noun phrases (NP) being applied to increase the effectiveness and efficiency of the mechanisms for the document's classification. Our hypothesis is the fact that the NP can be used instead of single words as a semantic aggregator to reduce the number of words that will be used for the classification system without losing its semantic coverage, increasing its efficiency. The experiment divided the documents classification process in three phases: a) NP preprocessing b) system training; and c) classification experiments. In the first step, a corpus of digitalized texts was submitted to a natural language processing platform1 in which the part-of-speech tagging was done, and them PERL scripts pertaining to the PALAVRAS package were used to extract the Noun Phrases. The preprocessing also involved the tasks of a) removing NP low meaning pre-modifiers, as quantifiers; b) identification of synonyms and corresponding substitution for common hyperonyms; and c) stemming of the relevant words contained in the NP, for similitude checking with other NPs. The first tests with the resulting documents have demonstrated its effectiveness. We have compared the structural similarity of the documents before and after the whole pre-processing steps of phase one. The texts maintained the consistency with the original and have kept the readability. The second phase involves submitting the modified documents to a SVM algorithm to identify clusters and classify the documents. The classification rules are to be established using a machine learning approach. Finally, tests will be conducted to check the effectiveness of the whole process.
- Source
- Knowledge organization in the 21st century: between historical patterns and future prospects. Proceedings of the Thirteenth International ISKO Conference 19-22 May 2014, Kraków, Poland. Ed.: Wieslaw Babik
-
Salton, G.; Allen, J.; Buckley, C.; Singhal, A.: Automatic analysis, theme generation, and summarization of machine-readable data (1994)
0.02
0.018105512 = product of:
0.07242205 = sum of:
0.07242205 = weight(_text_:data in 1168) [ClassicSimilarity], result of:
0.07242205 = score(doc=1168,freq=2.0), product of:
0.14807065 = queryWeight, product of:
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.046827413 = queryNorm
0.48910472 = fieldWeight in 1168, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.109375 = fieldNorm(doc=1168)
0.25 = coord(1/4)
-
Gross, D.: Maschinelle Bilderkennung mit Big Data und Deep Learning (2017)
0.02
0.017919812 = product of:
0.07167925 = sum of:
0.07167925 = weight(_text_:data in 3726) [ClassicSimilarity], result of:
0.07167925 = score(doc=3726,freq=6.0), product of:
0.14807065 = queryWeight, product of:
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.046827413 = queryNorm
0.48408815 = fieldWeight in 3726, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.0625 = fieldNorm(doc=3726)
0.25 = coord(1/4)
- Abstract
- Die Arbeit mit unstrukturierten Daten dient gerne als Paradebeispiel für Big Data, weil die technologischen Möglichkeiten das Speichern und Verarbeiten großer Datenmengen erlauben und die Mehrheit dieser Daten unstrukturiert ist. Allerdings ist im Zusammenhang mit unstrukturierten Daten meist von der Analyse und der Extraktion von Informationen aus Texten die Rede. Viel weniger hingegen wird das Thema der Bildanalyse thematisiert. Diese gilt aber nach wie vor als eine Königdisziplin der modernen Computerwissenschaft.
- Source
- https://jaxenter.de/big-data-bildanalyse-50313
-
Jones, K.P.: Natural-language processing and automatic indexing : a reply (1990)
0.02
0.016956951 = product of:
0.067827806 = sum of:
0.067827806 = product of:
0.13565561 = sum of:
0.13565561 = weight(_text_:processing in 394) [ClassicSimilarity], result of:
0.13565561 = score(doc=394,freq=2.0), product of:
0.18956426 = queryWeight, product of:
4.048147 = idf(docFreq=2097, maxDocs=44218)
0.046827413 = queryNorm
0.7156181 = fieldWeight in 394, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.048147 = idf(docFreq=2097, maxDocs=44218)
0.125 = fieldNorm(doc=394)
0.5 = coord(1/2)
0.25 = coord(1/4)
-
¬The smart retrieval system : experiments in automatic document processing (1971)
0.02
0.016956951 = product of:
0.067827806 = sum of:
0.067827806 = product of:
0.13565561 = sum of:
0.13565561 = weight(_text_:processing in 2330) [ClassicSimilarity], result of:
0.13565561 = score(doc=2330,freq=2.0), product of:
0.18956426 = queryWeight, product of:
4.048147 = idf(docFreq=2097, maxDocs=44218)
0.046827413 = queryNorm
0.7156181 = fieldWeight in 2330, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.048147 = idf(docFreq=2097, maxDocs=44218)
0.125 = fieldNorm(doc=2330)
0.5 = coord(1/2)
0.25 = coord(1/4)
