-
Verwer, K.: Freiheit und Verantwortung bei Hans Jonas (2011)
0.30
0.2974974 = product of:
0.5949948 = sum of:
0.1487487 = product of:
0.44624606 = sum of:
0.44624606 = weight(_text_:3a in 973) [ClassicSimilarity], result of:
0.44624606 = score(doc=973,freq=2.0), product of:
0.39700332 = queryWeight, product of:
8.478011 = idf(docFreq=24, maxDocs=44218)
0.046827413 = queryNorm
1.1240361 = fieldWeight in 973, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
8.478011 = idf(docFreq=24, maxDocs=44218)
0.09375 = fieldNorm(doc=973)
0.33333334 = coord(1/3)
0.44624606 = weight(_text_:2f in 973) [ClassicSimilarity], result of:
0.44624606 = score(doc=973,freq=2.0), product of:
0.39700332 = queryWeight, product of:
8.478011 = idf(docFreq=24, maxDocs=44218)
0.046827413 = queryNorm
1.1240361 = fieldWeight in 973, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
8.478011 = idf(docFreq=24, maxDocs=44218)
0.09375 = fieldNorm(doc=973)
0.5 = coord(2/4)
- Content
- Vgl.: http%3A%2F%2Fcreativechoice.org%2Fdoc%2FHansJonas.pdf&usg=AOvVaw1TM3teaYKgABL5H9yoIifA&opi=89978449.
-
Farazi, M.: Faceted lightweight ontologies : a formalization and some experiments (2010)
0.21
0.21336986 = product of:
0.28449315 = sum of:
0.061978623 = product of:
0.18593587 = sum of:
0.18593587 = weight(_text_:3a in 4997) [ClassicSimilarity], result of:
0.18593587 = score(doc=4997,freq=2.0), product of:
0.39700332 = queryWeight, product of:
8.478011 = idf(docFreq=24, maxDocs=44218)
0.046827413 = queryNorm
0.46834838 = fieldWeight in 4997, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
8.478011 = idf(docFreq=24, maxDocs=44218)
0.0390625 = fieldNorm(doc=4997)
0.33333334 = coord(1/3)
0.18593587 = weight(_text_:2f in 4997) [ClassicSimilarity], result of:
0.18593587 = score(doc=4997,freq=2.0), product of:
0.39700332 = queryWeight, product of:
8.478011 = idf(docFreq=24, maxDocs=44218)
0.046827413 = queryNorm
0.46834838 = fieldWeight in 4997, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
8.478011 = idf(docFreq=24, maxDocs=44218)
0.0390625 = fieldNorm(doc=4997)
0.03657866 = weight(_text_:data in 4997) [ClassicSimilarity], result of:
0.03657866 = score(doc=4997,freq=4.0), product of:
0.14807065 = queryWeight, product of:
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.046827413 = queryNorm
0.24703519 = fieldWeight in 4997, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.0390625 = fieldNorm(doc=4997)
0.75 = coord(3/4)
- Abstract
- While classifications are heavily used to categorize web content, the evolution of the web foresees a more formal structure - ontology - which can serve this purpose. Ontologies are core artifacts of the Semantic Web which enable machines to use inference rules to conduct automated reasoning on data. Lightweight ontologies bridge the gap between classifications and ontologies. A lightweight ontology (LO) is an ontology representing a backbone taxonomy where the concept of the child node is more specific than the concept of the parent node. Formal lightweight ontologies can be generated from their informal ones. The key applications of formal lightweight ontologies are document classification, semantic search, and data integration. However, these applications suffer from the following problems: the disambiguation accuracy of the state of the art NLP tools used in generating formal lightweight ontologies from their informal ones; the lack of background knowledge needed for the formal lightweight ontologies; and the limitation of ontology reuse. In this dissertation, we propose a novel solution to these problems in formal lightweight ontologies; namely, faceted lightweight ontology (FLO). FLO is a lightweight ontology in which terms, present in each node label, and their concepts, are available in the background knowledge (BK), which is organized as a set of facets. A facet can be defined as a distinctive property of the groups of concepts that can help in differentiating one group from another. Background knowledge can be defined as a subset of a knowledge base, such as WordNet, and often represents a specific domain.
- Content
- PhD Dissertation at International Doctorate School in Information and Communication Technology. Vgl.: https%3A%2F%2Fcore.ac.uk%2Fdownload%2Fpdf%2F150083013.pdf&usg=AOvVaw2n-qisNagpyT0lli_6QbAQ.
-
Gabler, S.: Vergabe von DDC-Sachgruppen mittels eines Schlagwort-Thesaurus (2021)
0.21
0.20533463 = product of:
0.2737795 = sum of:
0.061978623 = product of:
0.18593587 = sum of:
0.18593587 = weight(_text_:3a in 1000) [ClassicSimilarity], result of:
0.18593587 = score(doc=1000,freq=2.0), product of:
0.39700332 = queryWeight, product of:
8.478011 = idf(docFreq=24, maxDocs=44218)
0.046827413 = queryNorm
0.46834838 = fieldWeight in 1000, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
8.478011 = idf(docFreq=24, maxDocs=44218)
0.0390625 = fieldNorm(doc=1000)
0.33333334 = coord(1/3)
0.18593587 = weight(_text_:2f in 1000) [ClassicSimilarity], result of:
0.18593587 = score(doc=1000,freq=2.0), product of:
0.39700332 = queryWeight, product of:
8.478011 = idf(docFreq=24, maxDocs=44218)
0.046827413 = queryNorm
0.46834838 = fieldWeight in 1000, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
8.478011 = idf(docFreq=24, maxDocs=44218)
0.0390625 = fieldNorm(doc=1000)
0.02586502 = weight(_text_:data in 1000) [ClassicSimilarity], result of:
0.02586502 = score(doc=1000,freq=2.0), product of:
0.14807065 = queryWeight, product of:
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.046827413 = queryNorm
0.17468026 = fieldWeight in 1000, 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=1000)
0.75 = coord(3/4)
- Abstract
- Vorgestellt wird die Konstruktion eines thematisch geordneten Thesaurus auf Basis der Sachschlagwörter der Gemeinsamen Normdatei (GND) unter Nutzung der darin enthaltenen DDC-Notationen. Oberste Ordnungsebene dieses Thesaurus werden die DDC-Sachgruppen der Deutschen Nationalbibliothek. Die Konstruktion des Thesaurus erfolgt regelbasiert unter der Nutzung von Linked Data Prinzipien in einem SPARQL Prozessor. Der Thesaurus dient der automatisierten Gewinnung von Metadaten aus wissenschaftlichen Publikationen mittels eines computerlinguistischen Extraktors. Hierzu werden digitale Volltexte verarbeitet. Dieser ermittelt die gefundenen Schlagwörter über Vergleich der Zeichenfolgen Benennungen im Thesaurus, ordnet die Treffer nach Relevanz im Text und gibt die zugeordne-ten Sachgruppen rangordnend zurück. Die grundlegende Annahme dabei ist, dass die gesuchte Sachgruppe unter den oberen Rängen zurückgegeben wird. In einem dreistufigen Verfahren wird die Leistungsfähigkeit des Verfahrens validiert. Hierzu wird zunächst anhand von Metadaten und Erkenntnissen einer Kurzautopsie ein Goldstandard aus Dokumenten erstellt, die im Online-Katalog der DNB abrufbar sind. Die Dokumente vertei-len sich über 14 der Sachgruppen mit einer Losgröße von jeweils 50 Dokumenten. Sämtliche Dokumente werden mit dem Extraktor erschlossen und die Ergebnisse der Kategorisierung do-kumentiert. Schließlich wird die sich daraus ergebende Retrievalleistung sowohl für eine harte (binäre) Kategorisierung als auch eine rangordnende Rückgabe der Sachgruppen beurteilt.
- Content
- Master thesis Master of Science (Library and Information Studies) (MSc), Universität Wien. Advisor: Christoph Steiner. Vgl.: https://www.researchgate.net/publication/371680244_Vergabe_von_DDC-Sachgruppen_mittels_eines_Schlagwort-Thesaurus. DOI: 10.25365/thesis.70030. Vgl. dazu die Präsentation unter: https://www.google.com/url?sa=i&rct=j&q=&esrc=s&source=web&cd=&ved=0CAIQw7AJahcKEwjwoZzzytz_AhUAAAAAHQAAAAAQAg&url=https%3A%2F%2Fwiki.dnb.de%2Fdownload%2Fattachments%2F252121510%2FDA3%2520Workshop-Gabler.pdf%3Fversion%3D1%26modificationDate%3D1671093170000%26api%3Dv2&psig=AOvVaw0szwENK1or3HevgvIDOfjx&ust=1687719410889597&opi=89978449.
-
Huo, W.: Automatic multi-word term extraction and its application to Web-page summarization (2012)
0.20
0.20489585 = product of:
0.27319446 = sum of:
0.22312303 = weight(_text_:2f in 563) [ClassicSimilarity], result of:
0.22312303 = score(doc=563,freq=2.0), product of:
0.39700332 = queryWeight, product of:
8.478011 = idf(docFreq=24, maxDocs=44218)
0.046827413 = queryNorm
0.56201804 = fieldWeight in 563, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
8.478011 = idf(docFreq=24, maxDocs=44218)
0.046875 = fieldNorm(doc=563)
0.031038022 = weight(_text_:data in 563) [ClassicSimilarity], result of:
0.031038022 = score(doc=563,freq=2.0), product of:
0.14807065 = queryWeight, product of:
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.046827413 = queryNorm
0.2096163 = fieldWeight in 563, 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=563)
0.019033402 = product of:
0.038066804 = sum of:
0.038066804 = weight(_text_:22 in 563) [ClassicSimilarity], result of:
0.038066804 = score(doc=563,freq=2.0), product of:
0.16398162 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.046827413 = queryNorm
0.23214069 = fieldWeight in 563, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.046875 = fieldNorm(doc=563)
0.5 = coord(1/2)
0.75 = coord(3/4)
- Abstract
- In this thesis we propose three new word association measures for multi-word term extraction. We combine these association measures with LocalMaxs algorithm in our extraction model and compare the results of different multi-word term extraction methods. Our approach is language and domain independent and requires no training data. It can be applied to such tasks as text summarization, information retrieval, and document classification. We further explore the potential of using multi-word terms as an effective representation for general web-page summarization. We extract multi-word terms from human written summaries in a large collection of web-pages, and generate the summaries by aligning document words with these multi-word terms. Our system applies machine translation technology to learn the aligning process from a training set and focuses on selecting high quality multi-word terms from human written summaries to generate suitable results for web-page summarization.
- Content
- A Thesis presented to The University of Guelph In partial fulfilment of requirements for the degree of Master of Science in Computer Science. Vgl. Unter: http://www.inf.ufrgs.br%2F~ceramisch%2Fdownload_files%2Fpublications%2F2009%2Fp01.pdf.
- Date
- 10. 1.2013 19:22:47
-
Xiong, C.: Knowledge based text representations for information retrieval (2016)
0.13
0.12997265 = product of:
0.2599453 = sum of:
0.0495829 = product of:
0.1487487 = sum of:
0.1487487 = weight(_text_:3a in 5820) [ClassicSimilarity], result of:
0.1487487 = score(doc=5820,freq=2.0), product of:
0.39700332 = queryWeight, product of:
8.478011 = idf(docFreq=24, maxDocs=44218)
0.046827413 = queryNorm
0.3746787 = fieldWeight in 5820, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
8.478011 = idf(docFreq=24, maxDocs=44218)
0.03125 = fieldNorm(doc=5820)
0.33333334 = coord(1/3)
0.2103624 = weight(_text_:2f in 5820) [ClassicSimilarity], result of:
0.2103624 = score(doc=5820,freq=4.0), product of:
0.39700332 = queryWeight, product of:
8.478011 = idf(docFreq=24, maxDocs=44218)
0.046827413 = queryNorm
0.5298757 = fieldWeight in 5820, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
8.478011 = idf(docFreq=24, maxDocs=44218)
0.03125 = fieldNorm(doc=5820)
0.5 = coord(2/4)
- Content
- Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Language and Information Technologies. Vgl.: https%3A%2F%2Fwww.cs.cmu.edu%2F~cx%2Fpapers%2Fknowledge_based_text_representation.pdf&usg=AOvVaw0SaTSvhWLTh__Uz_HtOtl3.
-
Shala, E.: ¬Die Autonomie des Menschen und der Maschine : gegenwärtige Definitionen von Autonomie zwischen philosophischem Hintergrund und technologischer Umsetzbarkeit (2014)
0.12
0.12395725 = product of:
0.2479145 = sum of:
0.061978623 = product of:
0.18593587 = sum of:
0.18593587 = weight(_text_:3a in 4388) [ClassicSimilarity], result of:
0.18593587 = score(doc=4388,freq=2.0), product of:
0.39700332 = queryWeight, product of:
8.478011 = idf(docFreq=24, maxDocs=44218)
0.046827413 = queryNorm
0.46834838 = fieldWeight in 4388, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
8.478011 = idf(docFreq=24, maxDocs=44218)
0.0390625 = fieldNorm(doc=4388)
0.33333334 = coord(1/3)
0.18593587 = weight(_text_:2f in 4388) [ClassicSimilarity], result of:
0.18593587 = score(doc=4388,freq=2.0), product of:
0.39700332 = queryWeight, product of:
8.478011 = idf(docFreq=24, maxDocs=44218)
0.046827413 = queryNorm
0.46834838 = fieldWeight in 4388, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
8.478011 = idf(docFreq=24, maxDocs=44218)
0.0390625 = fieldNorm(doc=4388)
0.5 = coord(2/4)
- Footnote
- Vgl. unter: https://www.google.de/url?sa=t&rct=j&q=&esrc=s&source=web&cd=2&cad=rja&uact=8&ved=2ahUKEwizweHljdbcAhVS16QKHXcFD9QQFjABegQICRAB&url=https%3A%2F%2Fwww.researchgate.net%2Fpublication%2F271200105_Die_Autonomie_des_Menschen_und_der_Maschine_-_gegenwartige_Definitionen_von_Autonomie_zwischen_philosophischem_Hintergrund_und_technologischer_Umsetzbarkeit_Redigierte_Version_der_Magisterarbeit_Karls&usg=AOvVaw06orrdJmFF2xbCCp_hL26q.
-
Piros, A.: Az ETO-jelzetek automatikus interpretálásának és elemzésének kérdései (2018)
0.12
0.12395725 = product of:
0.2479145 = sum of:
0.061978623 = product of:
0.18593587 = sum of:
0.18593587 = weight(_text_:3a in 855) [ClassicSimilarity], result of:
0.18593587 = score(doc=855,freq=2.0), product of:
0.39700332 = queryWeight, product of:
8.478011 = idf(docFreq=24, maxDocs=44218)
0.046827413 = queryNorm
0.46834838 = fieldWeight in 855, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
8.478011 = idf(docFreq=24, maxDocs=44218)
0.0390625 = fieldNorm(doc=855)
0.33333334 = coord(1/3)
0.18593587 = weight(_text_:2f in 855) [ClassicSimilarity], result of:
0.18593587 = score(doc=855,freq=2.0), product of:
0.39700332 = queryWeight, product of:
8.478011 = idf(docFreq=24, maxDocs=44218)
0.046827413 = queryNorm
0.46834838 = fieldWeight in 855, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
8.478011 = idf(docFreq=24, maxDocs=44218)
0.0390625 = fieldNorm(doc=855)
0.5 = coord(2/4)
- Content
- Vgl. auch: New automatic interpreter for complex UDC numbers. Unter: <https%3A%2F%2Fudcc.org%2Ffiles%2FAttilaPiros_EC_36-37_2014-2015.pdf&usg=AOvVaw3kc9CwDDCWP7aArpfjrs5b>
-
Stojanovic, N.: Ontology-based Information Retrieval : methods and tools for cooperative query answering (2005)
0.10
0.0991658 = product of:
0.1983316 = sum of:
0.0495829 = product of:
0.1487487 = sum of:
0.1487487 = weight(_text_:3a in 701) [ClassicSimilarity], result of:
0.1487487 = score(doc=701,freq=2.0), product of:
0.39700332 = queryWeight, product of:
8.478011 = idf(docFreq=24, maxDocs=44218)
0.046827413 = queryNorm
0.3746787 = fieldWeight in 701, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
8.478011 = idf(docFreq=24, maxDocs=44218)
0.03125 = fieldNorm(doc=701)
0.33333334 = coord(1/3)
0.1487487 = weight(_text_:2f in 701) [ClassicSimilarity], result of:
0.1487487 = score(doc=701,freq=2.0), product of:
0.39700332 = queryWeight, product of:
8.478011 = idf(docFreq=24, maxDocs=44218)
0.046827413 = queryNorm
0.3746787 = fieldWeight in 701, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
8.478011 = idf(docFreq=24, maxDocs=44218)
0.03125 = fieldNorm(doc=701)
0.5 = coord(2/4)
- Content
- Vgl.: http%3A%2F%2Fdigbib.ubka.uni-karlsruhe.de%2Fvolltexte%2Fdocuments%2F1627&ei=tAtYUYrBNoHKtQb3l4GYBw&usg=AFQjCNHeaxKkKU3-u54LWxMNYGXaaDLCGw&sig2=8WykXWQoDKjDSdGtAakH2Q&bvm=bv.44442042,d.Yms.
-
Mönnich, M.W.: Personalcomputer in Bibliotheken : Arbeitsplätze für Benutzer (1991)
0.04
0.03993276 = product of:
0.07986552 = sum of:
0.043894395 = weight(_text_:data in 5389) [ClassicSimilarity], result of:
0.043894395 = score(doc=5389,freq=4.0), product of:
0.14807065 = queryWeight, product of:
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.046827413 = queryNorm
0.29644224 = fieldWeight in 5389, 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=5389)
0.035971127 = product of:
0.071942255 = sum of:
0.071942255 = weight(_text_:processing in 5389) [ClassicSimilarity], result of:
0.071942255 = score(doc=5389,freq=4.0), product of:
0.18956426 = queryWeight, product of:
4.048147 = idf(docFreq=2097, maxDocs=44218)
0.046827413 = queryNorm
0.3795138 = fieldWeight in 5389, 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=5389)
0.5 = coord(1/2)
0.5 = coord(2/4)
- LCSH
- Libraries / Data processing
- Subject
- Libraries / Data processing
-
Makewita, S.M.: Investigating the generic information-seeking function of organisational decision-makers : perspectives on improving organisational information systems (2002)
0.04
0.036848556 = product of:
0.07369711 = sum of:
0.057835944 = weight(_text_:data in 642) [ClassicSimilarity], result of:
0.057835944 = score(doc=642,freq=10.0), product of:
0.14807065 = queryWeight, product of:
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.046827413 = queryNorm
0.39059696 = fieldWeight in 642, product of:
3.1622777 = tf(freq=10.0), with freq of:
10.0 = termFreq=10.0
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.0390625 = fieldNorm(doc=642)
0.01586117 = product of:
0.03172234 = sum of:
0.03172234 = weight(_text_:22 in 642) [ClassicSimilarity], result of:
0.03172234 = score(doc=642,freq=2.0), product of:
0.16398162 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.046827413 = queryNorm
0.19345059 = fieldWeight in 642, 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=642)
0.5 = coord(1/2)
0.5 = coord(2/4)
- Abstract
- The past decade has seen the emergence of a new paradigm in the corporate world where organisations emphasised connectivity as a means of exposing decision-makers to wider resources of information within and outside the organisation. Many organisations followed the initiatives of enhancing infrastructures, manipulating cultural shifts and emphasising managerial commitment for creating pools and networks of knowledge. However, the concept of connectivity is not merely presenting people with the data, but more importantly, to create environments where people can seek information efficiently. This paradigm has therefore caused a shift in the function of information systems in organisations. They have to be now assessed in relation to how they underpin people's information-seeking activities within the context of their organisational environment. This research project used interpretative research methods to investigate the nature of people's information-seeking activities at two culturally contrasting organisations. Outcomes of this research project provide insights into phenomena associated with people's information-seeking function, and show how they depend on the organisational context that is defined partly by information systems. It suggests that information-seeking is not just searching for data. The inefficiencies inherent in both people and their environments can bring opaqueness into people's data, which they need to avoid or eliminate as part of seeking information. This seems to have made information-seeking a two-tier process consisting of a primary process of searching and interpreting data and auxiliary process of avoiding and eliminating opaqueness in data. Based on this view, this research suggests that organisational information systems operate naturally as implicit dual-mechanisms to underpin the above two-tier process, and that improvements to information systems should concern maintaining the balance in these dual-mechanisms.
- Date
- 22. 7.2022 12:16:58
-
Li, Z.: ¬A domain specific search engine with explicit document relations (2013)
0.03
0.032997858 = product of:
0.065995716 = sum of:
0.04479953 = weight(_text_:data in 1210) [ClassicSimilarity], result of:
0.04479953 = score(doc=1210,freq=6.0), product of:
0.14807065 = queryWeight, product of:
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.046827413 = queryNorm
0.30255508 = fieldWeight in 1210, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.0390625 = fieldNorm(doc=1210)
0.021196188 = product of:
0.042392377 = sum of:
0.042392377 = weight(_text_:processing in 1210) [ClassicSimilarity], result of:
0.042392377 = score(doc=1210,freq=2.0), product of:
0.18956426 = queryWeight, product of:
4.048147 = idf(docFreq=2097, maxDocs=44218)
0.046827413 = queryNorm
0.22363065 = fieldWeight in 1210, 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=1210)
0.5 = coord(1/2)
0.5 = coord(2/4)
- Abstract
- The current web consists of documents that are highly heterogeneous and hard for machines to understand. The Semantic Web is a progressive movement of the Word Wide Web, aiming at converting the current web of unstructured documents to the web of data. In the Semantic Web, web documents are annotated with metadata using standardized ontology language. These annotated documents are directly processable by machines and it highly improves their usability and usefulness. In Ericsson, similar problems occur. There are massive documents being created with well-defined structures. Though these documents are about domain specific knowledge and can have rich relations, they are currently managed by a traditional search engine, which ignores the rich domain specific information and presents few data to users. Motivated by the Semantic Web, we aim to find standard ways to process these documents, extract rich domain specific information and annotate these data to documents with formal markup languages. We propose this project to develop a domain specific search engine for processing different documents and building explicit relations for them. This research project consists of the three main focuses: examining different domain specific documents and finding ways to extract their metadata; integrating a text search engine with an ontology server; exploring novel ways to build relations for documents. We implement this system and demonstrate its functions. As a prototype, the system provides required features and will be extended in the future.
-
Decker, B.: Data Mining in Öffentlichen Bibliotheken (2000)
0.03
0.025605064 = product of:
0.102420256 = sum of:
0.102420256 = weight(_text_:data in 4782) [ClassicSimilarity], result of:
0.102420256 = score(doc=4782,freq=4.0), product of:
0.14807065 = queryWeight, product of:
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.046827413 = queryNorm
0.69169855 = fieldWeight in 4782, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.109375 = fieldNorm(doc=4782)
0.25 = coord(1/4)
- Theme
- Data Mining
-
Reinke, U.: ¬Der Austausch terminologischer Daten (1993)
0.02
0.023134377 = product of:
0.09253751 = sum of:
0.09253751 = weight(_text_:data in 4608) [ClassicSimilarity], result of:
0.09253751 = score(doc=4608,freq=10.0), product of:
0.14807065 = queryWeight, product of:
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.046827413 = queryNorm
0.6249551 = fieldWeight in 4608, product of:
3.1622777 = tf(freq=10.0), with freq of:
10.0 = termFreq=10.0
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.0625 = fieldNorm(doc=4608)
0.25 = coord(1/4)
- Abstract
- Diplomarbeit at the University of Saarbrücken which contains the following topics: data exchange format; terminology management systems; terminological databases; terminological record; data elements; data categories; data fields, etc.: hard- and software-related difficulties for the structure of records; description of approaches for the development of an exchange format for terminological data (MATER, MicroMATER, NTRF, SGML); considerations concerning an SGML-like exchange format; perspectives
-
Rohner, M.: Betrachtung der Data Visualization Literacy in der angestrebten Schweizer Informationsgesellschaft (2018)
0.02
0.020529725 = product of:
0.0821189 = sum of:
0.0821189 = weight(_text_:data in 4585) [ClassicSimilarity], result of:
0.0821189 = score(doc=4585,freq=14.0), product of:
0.14807065 = queryWeight, product of:
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.046827413 = queryNorm
0.55459267 = fieldWeight in 4585, product of:
3.7416575 = tf(freq=14.0), with freq of:
14.0 = termFreq=14.0
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.046875 = fieldNorm(doc=4585)
0.25 = coord(1/4)
- Abstract
- Datenvisualisierungen sind ein wichtiges Werkzeug, um Inhalte und Muster in Datensätzen zu erkennen und ermöglichen so auch Laien den Zugang zu der Information, die in Datensätzen steckt. Data Visualization Literacy ist die Kompetenz, Datenvisualisierungen zu lesen, zu verstehen, zu hinterfragen und herzustellen. Data Visulaization Literacy ist daher eine wichtige Kompetenz der Informationsgesellschaft. Im Auftrag des Bundesrates hat das Bundesamt für Kommunikation BAKOM die Strategie "Digitale Schweiz" entwickelt. Die Strategie zeigt auf, wie die fortschreitende Digitalisierung genutzt und die Schweiz zu einer Informationsgesellschaft entwickelt werden soll. In der vorliegenden Arbeit wird untersucht, inwiefern die Strategie "Digitale Schweiz" die Förderung von Data Visualization Literacy in der Bevölkerung unterstützt. Dazu werden die Kompetenzen der Data Visualization Literacy ermittelt, Kompetenzstellen innerhalb des Bildungssystems benannt und die Massnahmen der Strategie in Bezug auf Data Visualization Literacy überprüft.
- Content
- Diese Publikation entstand im Rahmen einer Thesis zum Master of Science FHO in Business Administration, Major Information and Data Management.
-
Karlova-Bourbonus, N.: Automatic detection of contradictions in texts (2018)
0.02
0.020477219 = product of:
0.040954437 = sum of:
0.015519011 = weight(_text_:data in 5976) [ClassicSimilarity], result of:
0.015519011 = score(doc=5976,freq=2.0), product of:
0.14807065 = queryWeight, product of:
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.046827413 = queryNorm
0.10480815 = fieldWeight in 5976, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.0234375 = fieldNorm(doc=5976)
0.025435425 = product of:
0.05087085 = sum of:
0.05087085 = weight(_text_:processing in 5976) [ClassicSimilarity], result of:
0.05087085 = score(doc=5976,freq=8.0), product of:
0.18956426 = queryWeight, product of:
4.048147 = idf(docFreq=2097, maxDocs=44218)
0.046827413 = queryNorm
0.26835677 = fieldWeight in 5976, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
4.048147 = idf(docFreq=2097, maxDocs=44218)
0.0234375 = fieldNorm(doc=5976)
0.5 = coord(1/2)
0.5 = coord(2/4)
- Abstract
- Implicit contradictions will only partially be the subject of the present study, aiming primarily at identifying the realization mechanism and cues (Chapter 5) as well as finding the parts of contradictions by applying the state of the art algorithms for natural language processing without conducting deep meaning processing. Further in focus are the explicit and implicit contradictions that can be detected by means of explicit linguistic, structural, lexical cues, and by conducting some additional processing operations (e.g., counting the sum in order to detect contradictions arising from numerical divergencies). One should note that an additional complexity in finding contradictions can arise in case parts of the contradictions occur on different levels of realization. Thus, a contradiction can be observed on the word- and phrase-level, such as in a married bachelor (for variations of contradictions on lexical level, see Ganeev 2004), on the sentence level - between parts of a sentence or between two or more sentences, or on the text level - between the portions of a text or between the whole texts such as a contradiction between the Bible and the Quran, for example. Only contradictions arising at the level of single sentences occurring in one or more texts, as well as parts of a sentence, will be considered for the purpose of this study. Though the focus of interest will be on single sentences, it will make use of text particularities such as coreference resolution without establishing the referents in the real world. Finally, another aspect to be considered is that parts of the contradictions are not neces-sarily to appear at the same time. They can be separated by many years and centuries with or without time expression making their recognition by human and detection by machine challenging. According to Aristotle's ontological version of the LNC (Section 3.1.1), how-ever, the same time reference is required in order for two statements to be judged as a contradiction. Taking this into account, we set the borders for the study by limiting the ana-lyzed textual data thematically (only nine world events) and temporally (three days after the reported event had happened) (Section 5.1). No sophisticated time processing will thus be conducted.
-
Smith, D.A.: Exploratory and faceted browsing over heterogeneous and cross-domain data sources. (2011)
0.02
0.017350782 = product of:
0.06940313 = sum of:
0.06940313 = weight(_text_:data in 4839) [ClassicSimilarity], result of:
0.06940313 = score(doc=4839,freq=10.0), product of:
0.14807065 = queryWeight, product of:
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.046827413 = queryNorm
0.46871632 = fieldWeight in 4839, product of:
3.1622777 = tf(freq=10.0), with freq of:
10.0 = termFreq=10.0
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.046875 = fieldNorm(doc=4839)
0.25 = coord(1/4)
- Abstract
- Exploration of heterogeneous data sources increases the value of information by allowing users to answer questions through exploration across multiple sources; Users can use information that has been posted across the Web to answer questions and learn about new domains. We have conducted research that lowers the interrogation time of faceted data, by combining related information from different sources. The work contributes methodologies in combining heterogenous sources, and how to deliver that data to a user interface scalably, with enough performance to support rapid interrogation of the knowledge by the user. The work also contributes how to combine linked data sources so that users can create faceted browsers that target the information facets of their needs. The work is grounded and proven in a number of experiments and test cases that study the contributions in domain research work.
-
Nagy T., I.: Detecting multiword expressions and named entities in natural language texts (2014)
0.02
0.016471423 = product of:
0.032942846 = sum of:
0.018105512 = weight(_text_:data in 1536) [ClassicSimilarity], result of:
0.018105512 = score(doc=1536,freq=2.0), product of:
0.14807065 = queryWeight, product of:
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.046827413 = queryNorm
0.12227618 = fieldWeight in 1536, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.02734375 = fieldNorm(doc=1536)
0.014837332 = product of:
0.029674664 = sum of:
0.029674664 = weight(_text_:processing in 1536) [ClassicSimilarity], result of:
0.029674664 = score(doc=1536,freq=2.0), product of:
0.18956426 = queryWeight, product of:
4.048147 = idf(docFreq=2097, maxDocs=44218)
0.046827413 = queryNorm
0.15654145 = fieldWeight in 1536, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.048147 = idf(docFreq=2097, maxDocs=44218)
0.02734375 = fieldNorm(doc=1536)
0.5 = coord(1/2)
0.5 = coord(2/4)
- Abstract
- Multiword expressions (MWEs) are lexical items that can be decomposed into single words and display lexical, syntactic, semantic, pragmatic and/or statistical idiosyncrasy (Sag et al., 2002; Kim, 2008; Calzolari et al., 2002). The proper treatment of multiword expressions such as rock 'n' roll and make a decision is essential for many natural language processing (NLP) applications like information extraction and retrieval, terminology extraction and machine translation, and it is important to identify multiword expressions in context. For example, in machine translation we must know that MWEs form one semantic unit, hence their parts should not be translated separately. For this, multiword expressions should be identified first in the text to be translated. The chief aim of this thesis is to develop machine learning-based approaches for the automatic detection of different types of multiword expressions in English and Hungarian natural language texts. In our investigations, we pay attention to the characteristics of different types of multiword expressions such as nominal compounds, multiword named entities and light verb constructions, and we apply novel methods to identify MWEs in raw texts. In the thesis it will be demonstrated that nominal compounds and multiword amed entities may require a similar approach for their automatic detection as they behave in the same way from a linguistic point of view. Furthermore, it will be shown that the automatic detection of light verb constructions can be carried out using two effective machine learning-based approaches.
In this thesis, we focused on the automatic detection of multiword expressions in natural language texts. On the basis of the main contributions, we can argue that: - Supervised machine learning methods can be successfully applied for the automatic detection of different types of multiword expressions in natural language texts. - Machine learning-based multiword expression detection can be successfully carried out for English as well as for Hungarian. - Our supervised machine learning-based model was successfully applied to the automatic detection of nominal compounds from English raw texts. - We developed a Wikipedia-based dictionary labeling method to automatically detect English nominal compounds. - A prior knowledge of nominal compounds can enhance Named Entity Recognition, while previously identified named entities can assist the nominal compound identification process. - The machine learning-based method can also provide acceptable results when it was trained on an automatically generated silver standard corpus. - As named entities form one semantic unit and may consist of more than one word and function as a noun, we can treat them in a similar way to nominal compounds. - Our sequence labelling-based tool can be successfully applied for identifying verbal light verb constructions in two typologically different languages, namely English and Hungarian. - Domain adaptation techniques may help diminish the distance between domains in the automatic detection of light verb constructions. - Our syntax-based method can be successfully applied for the full-coverage identification of light verb constructions. As a first step, a data-driven candidate extraction method can be utilized. After, a machine learning approach that makes use of an extended and rich feature set selects LVCs among extracted candidates. - When a precise syntactic parser is available for the actual domain, the full-coverage identification can be performed better. In other cases, the usage of the sequence labeling method is recommended.
-
Knitel, M.: ¬The application of linked data principles to library data : opportunities and challenges (2012)
0.02
0.015839024 = product of:
0.063356094 = sum of:
0.063356094 = weight(_text_:data in 599) [ClassicSimilarity], result of:
0.063356094 = score(doc=599,freq=12.0), product of:
0.14807065 = queryWeight, product of:
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.046827413 = queryNorm
0.4278775 = fieldWeight in 599, product of:
3.4641016 = tf(freq=12.0), with freq of:
12.0 = termFreq=12.0
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.0390625 = fieldNorm(doc=599)
0.25 = coord(1/4)
- Abstract
- Linked Data hat sich im Laufe der letzten Jahre zu einem vorherrschenden Thema der Bibliothekswissenschaft entwickelt. Als ein Standard für Erfassung und Austausch von Daten, bestehen zahlreiche Berührungspunkte mit traditionellen bibliothekarischen Techniken. Diese Arbeit stellt in einem ersten Teil die grundlegenden Technologien dieses neuen Paradigmas vor, um sodann deren Anwendung auf bibliothekarische Daten zu untersuchen. Den zentralen Prinzipien der Linked Data Initiative folgend, werden dabei die Adressierung von Entitäten durch URIs, die Anwendung des RDF Datenmodells und die Verknüpfung von heterogenen Datenbeständen näher beleuchtet. Den dabei zu Tage tretenden Herausforderungen der Sicherstellung von qualitativ hochwertiger Information, der permanenten Adressierung von Inhalten im World Wide Web sowie Problemen der Interoperabilität von Metadatenstandards wird dabei besondere Aufmerksamkeit geschenkt. Der letzte Teil der Arbeit skizziert ein Programm, welches eine mögliche Erweiterung der Suchmaschine des österreichischen Bibliothekenverbundes darstellt. Dessen prototypische Umsetzung erlaubt eine realistische Einschätzung der derzeitigen Möglichkeiten von Linked Data und unterstreicht viele der vorher theoretisch erarbeiteten Themengebiete. Es zeigt sich, dass für den voll produktiven Einsatz von Linked Data noch viele Hürden zu überwinden sind. Insbesondere befinden sich viele Projekte derzeit noch in einem frühen Reifegrad. Andererseits sind die Möglichkeiten, die aus einem konsequenten Einsatz von RDF resultieren würden, vielversprechend. RDF qualifiziert sich somit als Kandidat für den Ersatz von auslaufenden bibliographischen Datenformaten wie MAB oder MARC.
-
Vocht, L. De: Exploring semantic relationships in the Web of Data : Semantische relaties verkennen in data op het web (2017)
0.01
0.0137169985 = product of:
0.054867994 = sum of:
0.054867994 = weight(_text_:data in 4232) [ClassicSimilarity], result of:
0.054867994 = score(doc=4232,freq=36.0), product of:
0.14807065 = queryWeight, product of:
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.046827413 = queryNorm
0.3705528 = fieldWeight in 4232, product of:
6.0 = tf(freq=36.0), with freq of:
36.0 = termFreq=36.0
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.01953125 = fieldNorm(doc=4232)
0.25 = coord(1/4)
- Abstract
- After the launch of the World Wide Web, it became clear that searching documentson the Web would not be trivial. Well-known engines to search the web, like Google, focus on search in web documents using keywords. The documents are structured and indexed to ensure keywords match documents as accurately as possible. However, searching by keywords does not always suice. It is oen the case that users do not know exactly how to formulate the search query or which keywords guarantee retrieving the most relevant documents. Besides that, it occurs that users rather want to browse information than looking up something specific. It turned out that there is need for systems that enable more interactivity and facilitate the gradual refinement of search queries to explore the Web. Users expect more from the Web because the short keyword-based queries they pose during search, do not suffice for all cases. On top of that, the Web is changing structurally. The Web comprises, apart from a collection of documents, more and more linked data, pieces of information structured so they can be processed by machines. The consequently applied semantics allow users to exactly indicate machines their search intentions. This is made possible by describing data following controlled vocabularies, concept lists composed by experts, published uniquely identifiable on the Web. Even so, it is still not trivial to explore data on the Web. There is a large variety of vocabularies and various data sources use different terms to identify the same concepts.
This PhD-thesis describes how to effectively explore linked data on the Web. The main focus is on scenarios where users want to discover relationships between resources rather than finding out more about something specific. Searching for a specific document or piece of information fits in the theoretical framework of information retrieval and is associated with exploratory search. Exploratory search goes beyond 'looking up something' when users are seeking more detailed understanding, further investigation or navigation of the initial search results. The ideas behind exploratory search and querying linked data merge when it comes to the way knowledge is represented and indexed by machines - how data is structured and stored for optimal searchability. Queries and information should be aligned to facilitate that searches also reveal connections between results. This implies that they take into account the same semantic entities, relevant at that moment. To realize this, we research three techniques that are evaluated one by one in an experimental set-up to assess how well they succeed in their goals. In the end, the techniques are applied to a practical use case that focuses on forming a bridge between the Web and the use of digital libraries in scientific research. Our first technique focuses on the interactive visualization of search results. Linked data resources can be brought in relation with each other at will. This leads to complex and diverse graphs structures. Our technique facilitates navigation and supports a workflow starting from a broad overview on the data and allows narrowing down until the desired level of detail to then broaden again. To validate the flow, two visualizations where implemented and presented to test-users. The users judged the usability of the visualizations, how the visualizations fit in the workflow and to which degree their features seemed useful for the exploration of linked data.
The ideas behind exploratory search and querying linked data merge when it comes to the way knowledge is represented and indexed by machines - how data is structured and stored for optimal searchability. eries and information should be aligned to facilitate that searches also reveal connections between results. This implies that they take into account the same semantic entities, relevant at that moment. To realize this, we research three techniques that are evaluated one by one in an experimental set-up to assess how well they succeed in their goals. In the end, the techniques are applied to a practical use case that focuses on forming a bridge between the Web and the use of digital libraries in scientific research.
Our first technique focuses on the interactive visualization of search results. Linked data resources can be brought in relation with each other at will. This leads to complex and diverse graphs structures. Our technique facilitates navigation and supports a workflow starting from a broad overview on the data and allows narrowing down until the desired level of detail to then broaden again. To validate the flow, two visualizations where implemented and presented to test-users. The users judged the usability of the visualizations, how the visualizations fit in the workflow and to which degree their features seemed useful for the exploration of linked data. There is a difference in the way users interact with resources, visually or textually, and how resources are represented for machines to be processed by algorithms. This difference complicates bridging the users' intents and machine executable queries. It is important to implement this 'translation' mechanism to impact the search as favorable as possible in terms of performance, complexity and accuracy. To do this, we explain a second technique, that supports such a bridging component. Our second technique is developed around three features that support the search process: looking up, relating and ranking resources. The main goal is to ensure that resources in the results are as precise and relevant as possible. During the evaluation of this technique, we did not only look at the precision of the search results but also investigated how the effectiveness of the search evolved while the user executed certain actions sequentially.
When we speak about finding relationships between resources, it is necessary to dive deeper in the structure. The graph structure of linked data where the semantics give meaning to the relationships between resources enable the execution of pathfinding algorithms. The assigned weights and heuristics are base components of such algorithms and ultimately define (the order) which resources are included in a path. These paths explain indirect connections between resources. Our third technique proposes an algorithm that optimizes the choice of resources in terms of serendipity. Some optimizations guard the consistence of candidate-paths where the coherence of consecutive connections is maximized to avoid trivial and too arbitrary paths. The implementation uses the A* algorithm, the de-facto reference when it comes to heuristically optimized minimal cost paths. The effectiveness of paths was measured based on common automatic metrics and surveys where the users could indicate their preference for paths, generated each time in a different way. Finally, all our techniques are applied to a use case about publications in digital libraries where they are aligned with information about scientific conferences and researchers. The application to this use case is a practical example because the different aspects of exploratory search come together. In fact, the techniques also evolved from the experiences when implementing the use case. Practical details about the semantic model are explained and the implementation of the search system is clarified module by module. The evaluation positions the result, a prototype of a tool to explore scientific publications, researchers and conferences next to some important alternatives.
-
Stünkel, M.: Neuere Methoden der inhaltlichen Erschließung schöner Literatur in öffentlichen Bibliotheken (1986)
0.01
0.012688936 = product of:
0.050755743 = sum of:
0.050755743 = product of:
0.101511486 = sum of:
0.101511486 = weight(_text_:22 in 5815) [ClassicSimilarity], result of:
0.101511486 = score(doc=5815,freq=2.0), product of:
0.16398162 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.046827413 = queryNorm
0.61904186 = fieldWeight in 5815, 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=5815)
0.5 = coord(1/2)
0.25 = coord(1/4)
- Date
- 4. 8.2006 21:35:22
