-
Medien-Informationsmanagement : Archivarische, dokumentarische, betriebswirtschaftliche, rechtliche und Berufsbild-Aspekte ; [Frühjahrstagung der Fachgruppe 7 im Jahr 2000 in Weimar und Folgetagung 2001 in Köln] (2003)
0.01
0.010061655 = product of:
0.050308276 = sum of:
0.050308276 = sum of:
0.03547887 = weight(_text_:etc in 1833) [ClassicSimilarity], result of:
0.03547887 = score(doc=1833,freq=2.0), product of:
0.19761753 = queryWeight, product of:
5.4164915 = idf(docFreq=533, maxDocs=44218)
0.036484417 = queryNorm
0.17953302 = fieldWeight in 1833, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
5.4164915 = idf(docFreq=533, maxDocs=44218)
0.0234375 = fieldNorm(doc=1833)
0.014829405 = weight(_text_:22 in 1833) [ClassicSimilarity], result of:
0.014829405 = score(doc=1833,freq=2.0), product of:
0.12776221 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.036484417 = queryNorm
0.116070345 = fieldWeight in 1833, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.0234375 = fieldNorm(doc=1833)
0.2 = coord(1/5)
- Abstract
- Als in den siebziger Jahren des vergangenen Jahrhunderts immer häufiger die Bezeichnung Informationsmanager für Leute propagiert wurde, die bis dahin als Dokumentare firmierten, wurde dies in den etablierten Kreisen der Archivare und Bibliothekare gelegentlich belächelt und als Zeichen einer Identitätskrise oder jedenfalls einer Verunsicherung des damit überschriebenen Berufsbilds gewertet. Für den Berufsstand der Medienarchivare/Mediendokumentare, die sich seit 1960 in der Fachgruppe 7 des Vereins, später Verbands deutscher Archivare (VdA) organisieren, gehörte diese Verortung im Zeichen neuer inhaltlicher Herausforderungen (Informationsflut) und Technologien (EDV) allerdings schon früh zu den Selbstverständlichkeiten des Berufsalltags. "Halt, ohne uns geht es nicht!" lautete die Überschrift eines Artikels im Verbandsorgan "Info 7", der sich mit der Einrichtung von immer mächtigeren Leitungsnetzen und immer schnelleren Datenautobahnen beschäftigte. Information, Informationsgesellschaft: diese Begriffe wurden damals fast nur im technischen Sinne verstanden. Die informatisierte, nicht die informierte Gesellschaft stand im Vordergrund - was wiederum Kritiker auf den Plan rief, von Joseph Weizenbaum in den USA bis hin zu den Informations-Ökologen in Bremen. Bei den nationalen, manchmal auch nur regionalen Projekten und Modellversuchen mit Datenautobahnen - auch beim frühen Btx - war nie so recht deutlich geworden, welche Inhalte in welcher Gestalt durch diese Netze und Straßen gejagt werden sollten und wer diese Inhalte eigentlich selektieren, portionieren, positionieren, kurz: managen sollte. Spätestens mit dem World Wide Web sind diese Projekte denn auch obsolet geworden, jedenfalls was die Hardware und Software anging. Geblieben ist das Thema Inhalte (neudeutsch: Content). Und - immer drängender im nicht nur technischen Verständnis - das Thema Informationsmanagement. MedienInformationsManagement war die Frühjahrstagung der Fachgruppe 7 im Jahr 2000 in Weimar überschrieben, und auch die Folgetagung 2001 in Köln, die der multimedialen Produktion einen dokumentarischen Pragmatismus gegenüber stellte, handelte vom Geschäftsfeld Content und von Content-Management-Systemen. Die in diesem 6. Band der Reihe Beiträge zur Mediendokumentation versammelten Vorträge und Diskussionsbeiträge auf diesen beiden Tagungen beleuchten das Titel-Thema aus den verschiedensten Blickwinkeln: archivarischen, dokumentarischen, kaufmännischen, berufsständischen und juristischen. Deutlich wird dabei, daß die Berufsbezeichnung Medienarchivarln/Mediendokumentarln ziemlich genau für all das steht, was heute mit sog. alten wie neuen Medien im organisatorischen, d.h. ordnenden und vermittelnden Sinne geschieht. Im besonderen Maße trifft dies auf das Internet und die aus ihm geborenen Intranets zu. Beide bedürfen genauso der ordnenden Hand, die sich an den alten Medien, an Buch, Zeitung, Tonträger, Film etc. geschult hat, denn sie leben zu großen Teilen davon. Daß das Internet gleichwohl ein Medium sui generis ist und die alten Informationsberufe vor ganz neue Herausforderungen stellt - auch das durchzieht die Beiträge von Weimar und Köln.
- Date
- 11. 5.2008 19:49:22
-
Knowledge management in fuzzy databases (2000)
0.01
0.008278403 = product of:
0.041392017 = sum of:
0.041392017 = product of:
0.082784034 = sum of:
0.082784034 = weight(_text_:etc in 4260) [ClassicSimilarity], result of:
0.082784034 = score(doc=4260,freq=2.0), product of:
0.19761753 = queryWeight, product of:
5.4164915 = idf(docFreq=533, maxDocs=44218)
0.036484417 = queryNorm
0.41891038 = fieldWeight in 4260, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
5.4164915 = idf(docFreq=533, maxDocs=44218)
0.0546875 = fieldNorm(doc=4260)
0.5 = coord(1/2)
0.2 = coord(1/5)
- Abstract
- The volume presents recent developments in the introduction of fuzzy, probabilistic and rough elements into basic components of fuzzy databases, and their use (notably querying and information retrieval), from the point of view of data mining and knowledge discovery. The main novel aspect of the volume is that issues related to the use of fuzzy elements in databases, database querying, information retrieval, etc. are presented and discussed from the point of view, and for the purpose of data mining and knowledge discovery that are 'hot topics' in recent years
-
Chowdhury, G.G.: Template mining for information extraction from digital documents (1999)
0.01
0.0069203894 = product of:
0.034601945 = sum of:
0.034601945 = product of:
0.06920389 = sum of:
0.06920389 = weight(_text_:22 in 4577) [ClassicSimilarity], result of:
0.06920389 = score(doc=4577,freq=2.0), product of:
0.12776221 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.036484417 = queryNorm
0.5416616 = fieldWeight in 4577, 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=4577)
0.5 = coord(1/2)
0.2 = coord(1/5)
- Date
- 2. 4.2000 18:01:22
-
Kong, S.; Ye, F.; Feng, L.; Zhao, Z.: Towards the prediction problems of bursting hashtags on Twitter (2015)
0.01
0.0067982078 = product of:
0.03399104 = sum of:
0.03399104 = product of:
0.06798208 = sum of:
0.06798208 = weight(_text_:problems in 2338) [ClassicSimilarity], result of:
0.06798208 = score(doc=2338,freq=4.0), product of:
0.15058853 = queryWeight, product of:
4.1274753 = idf(docFreq=1937, maxDocs=44218)
0.036484417 = queryNorm
0.4514426 = fieldWeight in 2338, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
4.1274753 = idf(docFreq=1937, maxDocs=44218)
0.0546875 = fieldNorm(doc=2338)
0.5 = coord(1/2)
0.2 = coord(1/5)
- Abstract
- Hundreds of thousands of hashtags are generated every day on Twitter. Only a few will burst and become trending topics. In this article, we provide the definition of a bursting hashtag and conduct a systematic study of a series of challenging prediction problems that span the entire life cycles of bursting hashtags. Around the problem of "how to build a system to predict bursting hashtags," we explore different types of features and present machine learning solutions. On real data sets from Twitter, experiments are conducted to evaluate the effectiveness of the proposed solutions and the contributions of features.
-
KDD : techniques and applications (1998)
0.01
0.005931762 = product of:
0.02965881 = sum of:
0.02965881 = product of:
0.05931762 = sum of:
0.05931762 = weight(_text_:22 in 6783) [ClassicSimilarity], result of:
0.05931762 = score(doc=6783,freq=2.0), product of:
0.12776221 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.036484417 = queryNorm
0.46428138 = fieldWeight in 6783, 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=6783)
0.5 = coord(1/2)
0.2 = coord(1/5)
- Footnote
- A special issue of selected papers from the Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD'97), held Singapore, 22-23 Feb 1997
-
Maaten, L. van den; Hinton, G.: Visualizing non-metric similarities in multiple maps (2012)
0.01
0.0058270353 = product of:
0.029135175 = sum of:
0.029135175 = product of:
0.05827035 = sum of:
0.05827035 = weight(_text_:problems in 3884) [ClassicSimilarity], result of:
0.05827035 = score(doc=3884,freq=4.0), product of:
0.15058853 = queryWeight, product of:
4.1274753 = idf(docFreq=1937, maxDocs=44218)
0.036484417 = queryNorm
0.3869508 = fieldWeight in 3884, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
4.1274753 = idf(docFreq=1937, maxDocs=44218)
0.046875 = fieldNorm(doc=3884)
0.5 = coord(1/2)
0.2 = coord(1/5)
- Abstract
- Techniques for multidimensional scaling visualize objects as points in a low-dimensional metric map. As a result, the visualizations are subject to the fundamental limitations of metric spaces. These limitations prevent multidimensional scaling from faithfully representing non-metric similarity data such as word associations or event co-occurrences. In particular, multidimensional scaling cannot faithfully represent intransitive pairwise similarities in a visualization, and it cannot faithfully visualize "central" objects. In this paper, we present an extension of a recently proposed multidimensional scaling technique called t-SNE. The extension aims to address the problems of traditional multidimensional scaling techniques when these techniques are used to visualize non-metric similarities. The new technique, called multiple maps t-SNE, alleviates these problems by constructing a collection of maps that reveal complementary structure in the similarity data. We apply multiple maps t-SNE to a large data set of word association data and to a data set of NIPS co-authorships, demonstrating its ability to successfully visualize non-metric similarities.
-
Fayyad, U.M.; Djorgovski, S.G.; Weir, N.: From digitized images to online catalogs : data ming a sky server (1996)
0.01
0.0054937815 = product of:
0.027468907 = sum of:
0.027468907 = product of:
0.054937813 = sum of:
0.054937813 = weight(_text_:problems in 6625) [ClassicSimilarity], result of:
0.054937813 = score(doc=6625,freq=2.0), product of:
0.15058853 = queryWeight, product of:
4.1274753 = idf(docFreq=1937, maxDocs=44218)
0.036484417 = queryNorm
0.36482072 = fieldWeight in 6625, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.1274753 = idf(docFreq=1937, maxDocs=44218)
0.0625 = fieldNorm(doc=6625)
0.5 = coord(1/2)
0.2 = coord(1/5)
- Abstract
- Offers a data mining approach based on machine learning classification methods to the problem of automated cataloguing of online databases of digital images resulting from sky surveys. The SKICAT system automates the reduction and analysis of 3 terabytes of images expected to contain about 2 billion sky objects. It offers a solution to problems associated with the analysis of large data sets in science
-
Cardie, C.: Empirical methods in information extraction (1997)
0.01
0.0054937815 = product of:
0.027468907 = sum of:
0.027468907 = product of:
0.054937813 = sum of:
0.054937813 = weight(_text_:problems in 3246) [ClassicSimilarity], result of:
0.054937813 = score(doc=3246,freq=2.0), product of:
0.15058853 = queryWeight, product of:
4.1274753 = idf(docFreq=1937, maxDocs=44218)
0.036484417 = queryNorm
0.36482072 = fieldWeight in 3246, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.1274753 = idf(docFreq=1937, maxDocs=44218)
0.0625 = fieldNorm(doc=3246)
0.5 = coord(1/2)
0.2 = coord(1/5)
- Abstract
- Surveys the use of empirical, machine-learning methods for information extraction. Presents a generic architecture for information extraction systems and surveys the learning algorithms that have been developed to address the problems of accuracy, portability, and knowledge acquisition for each component of the architecture
-
Wang, F.L.; Yang, C.C.: Mining Web data for Chinese segmentation (2007)
0.00
0.004855863 = product of:
0.024279313 = sum of:
0.024279313 = product of:
0.048558626 = sum of:
0.048558626 = weight(_text_:problems in 604) [ClassicSimilarity], result of:
0.048558626 = score(doc=604,freq=4.0), product of:
0.15058853 = queryWeight, product of:
4.1274753 = idf(docFreq=1937, maxDocs=44218)
0.036484417 = queryNorm
0.322459 = fieldWeight in 604, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
4.1274753 = idf(docFreq=1937, maxDocs=44218)
0.0390625 = fieldNorm(doc=604)
0.5 = coord(1/2)
0.2 = coord(1/5)
- Abstract
- Modern information retrieval systems use keywords within documents as indexing terms for search of relevant documents. As Chinese is an ideographic character-based language, the words in the texts are not delimited by white spaces. Indexing of Chinese documents is impossible without a proper segmentation algorithm. Many Chinese segmentation algorithms have been proposed in the past. Traditional segmentation algorithms cannot operate without a large dictionary or a large corpus of training data. Nowadays, the Web has become the largest corpus that is ideal for Chinese segmentation. Although most search engines have problems in segmenting texts into proper words, they maintain huge databases of documents and frequencies of character sequences in the documents. Their databases are important potential resources for segmentation. In this paper, we propose a segmentation algorithm by mining Web data with the help of search engines. On the other hand, the Romanized pinyin of Chinese language indicates boundaries of words in the text. Our algorithm is the first to utilize the Romanized pinyin to segmentation. It is the first unified segmentation algorithm for the Chinese language from different geographical areas, and it is also domain independent because of the nature of the Web. Experiments have been conducted on the datasets of a recent Chinese segmentation competition. The results show that our algorithm outperforms the traditional algorithms in terms of precision and recall. Moreover, our algorithm can effectively deal with the problems of segmentation ambiguity, new word (unknown word) detection, and stop words.
-
Raghavan, V.V.; Deogun, J.S.; Sever, H.: Knowledge discovery and data mining : introduction (1998)
0.00
0.0048070587 = product of:
0.024035294 = sum of:
0.024035294 = product of:
0.048070587 = sum of:
0.048070587 = weight(_text_:problems in 2899) [ClassicSimilarity], result of:
0.048070587 = score(doc=2899,freq=2.0), product of:
0.15058853 = queryWeight, product of:
4.1274753 = idf(docFreq=1937, maxDocs=44218)
0.036484417 = queryNorm
0.31921813 = fieldWeight in 2899, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.1274753 = idf(docFreq=1937, maxDocs=44218)
0.0546875 = fieldNorm(doc=2899)
0.5 = coord(1/2)
0.2 = coord(1/5)
- Abstract
- Defines knowledge discovery and database mining. The challenge for knowledge discovery in databases (KDD) is to automatically process large quantities of raw data, identifying the most significant and meaningful patterns, and present these as as knowledge appropriate for achieving a user's goals. Data mining is the process of deriving useful knowledge from real world databases through the application of pattern extraction techniques. Explains the goals of, and motivation for, research work on data mining. Discusses the nature of database contents, along with problems within the field of data mining
-
Baeza-Yates, R.; Hurtado, C.; Mendoza, M.: Improving search engines by query clustering (2007)
0.00
0.0048070587 = product of:
0.024035294 = sum of:
0.024035294 = product of:
0.048070587 = sum of:
0.048070587 = weight(_text_:problems in 601) [ClassicSimilarity], result of:
0.048070587 = score(doc=601,freq=2.0), product of:
0.15058853 = queryWeight, product of:
4.1274753 = idf(docFreq=1937, maxDocs=44218)
0.036484417 = queryNorm
0.31921813 = fieldWeight in 601, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.1274753 = idf(docFreq=1937, maxDocs=44218)
0.0546875 = fieldNorm(doc=601)
0.5 = coord(1/2)
0.2 = coord(1/5)
- Abstract
- In this paper, we present a framework for clustering Web search engine queries whose aim is to identify groups of queries used to search for similar information on the Web. The framework is based on a novel term vector model of queries that integrates user selections and the content of selected documents extracted from the logs of a search engine. The query representation obtained allows us to treat query clustering similarly to standard document clustering. We study the application of the clustering framework to two problems: relevance ranking boosting and query recommendation. Finally, we evaluate with experiments the effectiveness of our approach.
-
Information visualization in data mining and knowledge discovery (2002)
0.00
0.0047241445 = product of:
0.011810361 = sum of:
0.0068672267 = product of:
0.013734453 = sum of:
0.013734453 = weight(_text_:problems in 1789) [ClassicSimilarity], result of:
0.013734453 = score(doc=1789,freq=2.0), product of:
0.15058853 = queryWeight, product of:
4.1274753 = idf(docFreq=1937, maxDocs=44218)
0.036484417 = queryNorm
0.09120518 = fieldWeight in 1789, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.1274753 = idf(docFreq=1937, maxDocs=44218)
0.015625 = fieldNorm(doc=1789)
0.5 = coord(1/2)
0.0049431347 = product of:
0.009886269 = sum of:
0.009886269 = weight(_text_:22 in 1789) [ClassicSimilarity], result of:
0.009886269 = score(doc=1789,freq=2.0), product of:
0.12776221 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.036484417 = queryNorm
0.07738023 = fieldWeight in 1789, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.015625 = fieldNorm(doc=1789)
0.5 = coord(1/2)
0.4 = coord(2/5)
- Date
- 23. 3.2008 19:10:22
- Footnote
- Rez. in: JASIST 54(2003) no.9, S.905-906 (C.A. Badurek): "Visual approaches for knowledge discovery in very large databases are a prime research need for information scientists focused an extracting meaningful information from the ever growing stores of data from a variety of domains, including business, the geosciences, and satellite and medical imagery. This work presents a summary of research efforts in the fields of data mining, knowledge discovery, and data visualization with the goal of aiding the integration of research approaches and techniques from these major fields. The editors, leading computer scientists from academia and industry, present a collection of 32 papers from contributors who are incorporating visualization and data mining techniques through academic research as well application development in industry and government agencies. Information Visualization focuses upon techniques to enhance the natural abilities of humans to visually understand data, in particular, large-scale data sets. It is primarily concerned with developing interactive graphical representations to enable users to more intuitively make sense of multidimensional data as part of the data exploration process. It includes research from computer science, psychology, human-computer interaction, statistics, and information science. Knowledge Discovery in Databases (KDD) most often refers to the process of mining databases for previously unknown patterns and trends in data. Data mining refers to the particular computational methods or algorithms used in this process. The data mining research field is most related to computational advances in database theory, artificial intelligence and machine learning. This work compiles research summaries from these main research areas in order to provide "a reference work containing the collection of thoughts and ideas of noted researchers from the fields of data mining and data visualization" (p. 8). It addresses these areas in three main sections: the first an data visualization, the second an KDD and model visualization, and the last an using visualization in the knowledge discovery process. The seven chapters of Part One focus upon methodologies and successful techniques from the field of Data Visualization. Hoffman and Grinstein (Chapter 2) give a particularly good overview of the field of data visualization and its potential application to data mining. An introduction to the terminology of data visualization, relation to perceptual and cognitive science, and discussion of the major visualization display techniques are presented. Discussion and illustration explain the usefulness and proper context of such data visualization techniques as scatter plots, 2D and 3D isosurfaces, glyphs, parallel coordinates, and radial coordinate visualizations. Remaining chapters present the need for standardization of visualization methods, discussion of user requirements in the development of tools, and examples of using information visualization in addressing research problems.
-
Wu, X.: Rule induction with extension matrices (1998)
0.00
0.0041203364 = product of:
0.02060168 = sum of:
0.02060168 = product of:
0.04120336 = sum of:
0.04120336 = weight(_text_:problems in 2912) [ClassicSimilarity], result of:
0.04120336 = score(doc=2912,freq=2.0), product of:
0.15058853 = queryWeight, product of:
4.1274753 = idf(docFreq=1937, maxDocs=44218)
0.036484417 = queryNorm
0.27361554 = fieldWeight in 2912, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.1274753 = idf(docFreq=1937, maxDocs=44218)
0.046875 = fieldNorm(doc=2912)
0.5 = coord(1/2)
0.2 = coord(1/5)
- Abstract
- Presents a heuristic, attribute-based, noise-tolerant data mining program, HCV (Version 2.0), absed on the newly-developed extension matrix approach. Gives a simple example of attribute-based induction to show the difference between the rules in variable-valued logic produced by HCV, the decision tree generated by C4.5 and the decision tree's decompiled rules by C4.5 rules. Outlines the extension matrix approach for data mining. Describes the HCV algorithm in detail. Outlines techniques developed and implemented in the HCV program for noise handling and discretization of continuous domains respectively. Follows these with a performance comparison of HCV with famous ID3-like algorithms including C4.5 and C4.5 rules on a collection of standard databases including the famous MONK's problems
-
Kulathuramaiyer, N.; Maurer, H.: Implications of emerging data mining (2009)
0.00
0.0041203364 = product of:
0.02060168 = sum of:
0.02060168 = product of:
0.04120336 = sum of:
0.04120336 = weight(_text_:problems in 3144) [ClassicSimilarity], result of:
0.04120336 = score(doc=3144,freq=2.0), product of:
0.15058853 = queryWeight, product of:
4.1274753 = idf(docFreq=1937, maxDocs=44218)
0.036484417 = queryNorm
0.27361554 = fieldWeight in 3144, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.1274753 = idf(docFreq=1937, maxDocs=44218)
0.046875 = fieldNorm(doc=3144)
0.5 = coord(1/2)
0.2 = coord(1/5)
- Abstract
- Data Mining describes a technology that discovers non-trivial hidden patterns in a large collection of data. Although this technology has a tremendous impact on our lives, the invaluable contributions of this invisible technology often go unnoticed. This paper discusses advances in data mining while focusing on the emerging data mining capability. Such data mining applications perform multidimensional mining on a wide variety of heterogeneous data sources, providing solutions to many unresolved problems. This paper also highlights the advantages and disadvantages arising from the ever-expanding scope of data mining. Data Mining augments human intelligence by equipping us with a wealth of knowledge and by empowering us to perform our daily tasks better. As the mining scope and capacity increases, users and organizations become more willing to compromise privacy. The huge data stores of the 'master miners' allow them to gain deep insights into individual lifestyles and their social and behavioural patterns. Data integration and analysis capability of combining business and financial trends together with the ability to deterministically track market changes will drastically affect our lives.
-
Leydesdorff, L.; Persson, O.: Mapping the geography of science : distribution patterns and networks of relations among cities and institutes (2010)
0.00
0.0041203364 = product of:
0.02060168 = sum of:
0.02060168 = product of:
0.04120336 = sum of:
0.04120336 = weight(_text_:problems in 3704) [ClassicSimilarity], result of:
0.04120336 = score(doc=3704,freq=2.0), product of:
0.15058853 = queryWeight, product of:
4.1274753 = idf(docFreq=1937, maxDocs=44218)
0.036484417 = queryNorm
0.27361554 = fieldWeight in 3704, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.1274753 = idf(docFreq=1937, maxDocs=44218)
0.046875 = fieldNorm(doc=3704)
0.5 = coord(1/2)
0.2 = coord(1/5)
- Abstract
- Using Google Earth, Google Maps, and/or network visualization programs such as Pajek, one can overlay the network of relations among addresses in scientific publications onto the geographic map. The authors discuss the pros and cons of various options, and provide software (freeware) for bridging existing gaps between the Science Citation Indices (Thomson Reuters) and Scopus (Elsevier), on the one hand, and these various visualization tools on the other. At the level of city names, the global map can be drawn reliably on the basis of the available address information. At the level of the names of organizations and institutes, there are problems of unification both in the ISI databases and with Scopus. Pajek enables a combination of visualization and statistical analysis, whereas the Google Maps and its derivatives provide superior tools on the Internet.
-
Chen, Y.-L.; Liu, Y.-H.; Ho, W.-L.: ¬A text mining approach to assist the general public in the retrieval of legal documents (2013)
0.00
0.0041203364 = product of:
0.02060168 = sum of:
0.02060168 = product of:
0.04120336 = sum of:
0.04120336 = weight(_text_:problems in 521) [ClassicSimilarity], result of:
0.04120336 = score(doc=521,freq=2.0), product of:
0.15058853 = queryWeight, product of:
4.1274753 = idf(docFreq=1937, maxDocs=44218)
0.036484417 = queryNorm
0.27361554 = fieldWeight in 521, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.1274753 = idf(docFreq=1937, maxDocs=44218)
0.046875 = fieldNorm(doc=521)
0.5 = coord(1/2)
0.2 = coord(1/5)
- Abstract
- Applying text mining techniques to legal issues has been an emerging research topic in recent years. Although some previous studies focused on assisting professionals in the retrieval of related legal documents, they did not take into account the general public and their difficulty in describing legal problems in professional legal terms. Because this problem has not been addressed by previous research, this study aims to design a text-mining-based method that allows the general public to use everyday vocabulary to search for and retrieve criminal judgments. The experimental results indicate that our method can help the general public, who are not familiar with professional legal terms, to acquire relevant criminal judgments more accurately and effectively.
-
Organisciak, P.; Schmidt, B.M.; Downie, J.S.: Giving shape to large digital libraries through exploratory data analysis (2022)
0.00
0.0041203364 = product of:
0.02060168 = sum of:
0.02060168 = product of:
0.04120336 = sum of:
0.04120336 = weight(_text_:problems in 473) [ClassicSimilarity], result of:
0.04120336 = score(doc=473,freq=2.0), product of:
0.15058853 = queryWeight, product of:
4.1274753 = idf(docFreq=1937, maxDocs=44218)
0.036484417 = queryNorm
0.27361554 = fieldWeight in 473, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.1274753 = idf(docFreq=1937, maxDocs=44218)
0.046875 = fieldNorm(doc=473)
0.5 = coord(1/2)
0.2 = coord(1/5)
- Abstract
- The emergence of large multi-institutional digital libraries has opened the door to aggregate-level examinations of the published word. Such large-scale analysis offers a new way to pursue traditional problems in the humanities and social sciences, using digital methods to ask routine questions of large corpora. However, inquiry into multiple centuries of books is constrained by the burdens of scale, where statistical inference is technically complex and limited by hurdles to access and flexibility. This work examines the role that exploratory data analysis and visualization tools may play in understanding large bibliographic datasets. We present one such tool, HathiTrust+Bookworm, which allows multifaceted exploration of the multimillion work HathiTrust Digital Library, and center it in the broader space of scholarly tools for exploratory data analysis.
-
Matson, L.D.; Bonski, D.J.: Do digital libraries need librarians? (1997)
0.00
0.003954508 = product of:
0.019772539 = sum of:
0.019772539 = product of:
0.039545078 = sum of:
0.039545078 = weight(_text_:22 in 1737) [ClassicSimilarity], result of:
0.039545078 = score(doc=1737,freq=2.0), product of:
0.12776221 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.036484417 = queryNorm
0.30952093 = fieldWeight in 1737, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.0625 = fieldNorm(doc=1737)
0.5 = coord(1/2)
0.2 = coord(1/5)
- Date
- 22.11.1998 18:57:22
-
Lusti, M.: Data Warehousing and Data Mining : Eine Einführung in entscheidungsunterstützende Systeme (1999)
0.00
0.003954508 = product of:
0.019772539 = sum of:
0.019772539 = product of:
0.039545078 = sum of:
0.039545078 = weight(_text_:22 in 4261) [ClassicSimilarity], result of:
0.039545078 = score(doc=4261,freq=2.0), product of:
0.12776221 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.036484417 = queryNorm
0.30952093 = fieldWeight in 4261, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.0625 = fieldNorm(doc=4261)
0.5 = coord(1/2)
0.2 = coord(1/5)
- Date
- 17. 7.2002 19:22:06
-
Amir, A.; Feldman, R.; Kashi, R.: ¬A new and versatile method for association generation (1997)
0.00
0.003954508 = product of:
0.019772539 = sum of:
0.019772539 = product of:
0.039545078 = sum of:
0.039545078 = weight(_text_:22 in 1270) [ClassicSimilarity], result of:
0.039545078 = score(doc=1270,freq=2.0), product of:
0.12776221 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.036484417 = queryNorm
0.30952093 = fieldWeight in 1270, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.0625 = fieldNorm(doc=1270)
0.5 = coord(1/2)
0.2 = coord(1/5)
- Source
- Information systems. 22(1997) nos.5/6, S.333-347
