-
Wattenberg, M.; Viégas, F.; Johnson, I.: How to use t-SNE effectively (2016)
0.04
0.03567564 = product of:
0.07135128 = sum of:
0.07135128 = product of:
0.14270256 = sum of:
0.14270256 = weight(_text_:t in 3887) [ClassicSimilarity], result of:
0.14270256 = score(doc=3887,freq=8.0), product of:
0.20491594 = queryWeight, product of:
3.9394085 = idf(docFreq=2338, maxDocs=44218)
0.05201693 = queryNorm
0.69639564 = fieldWeight in 3887, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
3.9394085 = idf(docFreq=2338, maxDocs=44218)
0.0625 = fieldNorm(doc=3887)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Abstract
- Although extremely useful for visualizing high-dimensional data, t-SNE plots can sometimes be mysterious or misleading. By exploring how it behaves in simple cases, we can learn to use it more effectively. We'll walk through a series of simple examples to illustrate what t-SNE diagrams can and cannot show. The t-SNE technique really is useful-but only if you know how to interpret it.
-
Maaten, L. van den: Accelerating t-SNE using Tree-Based Algorithms (2014)
0.03
0.034900755 = product of:
0.06980151 = sum of:
0.06980151 = product of:
0.13960302 = sum of:
0.13960302 = weight(_text_:t in 3886) [ClassicSimilarity], result of:
0.13960302 = score(doc=3886,freq=10.0), product of:
0.20491594 = queryWeight, product of:
3.9394085 = idf(docFreq=2338, maxDocs=44218)
0.05201693 = queryNorm
0.6812697 = fieldWeight in 3886, product of:
3.1622777 = tf(freq=10.0), with freq of:
10.0 = termFreq=10.0
3.9394085 = idf(docFreq=2338, maxDocs=44218)
0.0546875 = fieldNorm(doc=3886)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Abstract
- The paper investigates the acceleration of t-SNE-an embedding technique that is commonly used for the visualization of high-dimensional data in scatter plots-using two tree-based algorithms. In particular, the paper develops variants of the Barnes-Hut algorithm and of the dual-tree algorithm that approximate the gradient used for learning t-SNE embeddings in O(N*logN). Our experiments show that the resulting algorithms substantially accelerate t-SNE, and that they make it possible to learn embeddings of data sets with millions of objects. Somewhat counterintuitively, the Barnes-Hut variant of t-SNE appears to outperform the dual-tree variant.
-
Hallonsten, O.; Holmberg, D.: Analyzing structural stratification in the Swedish higher education system : data contextualization with policy-history analysis (2013)
0.03
0.03254907 = sum of:
0.014930127 = product of:
0.05972051 = sum of:
0.05972051 = weight(_text_:authors in 668) [ClassicSimilarity], result of:
0.05972051 = score(doc=668,freq=2.0), product of:
0.2371355 = queryWeight, product of:
4.558814 = idf(docFreq=1258, maxDocs=44218)
0.05201693 = queryNorm
0.25184128 = fieldWeight in 668, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.558814 = idf(docFreq=1258, maxDocs=44218)
0.0390625 = fieldNorm(doc=668)
0.25 = coord(1/4)
0.01761894 = product of:
0.03523788 = sum of:
0.03523788 = weight(_text_:22 in 668) [ClassicSimilarity], result of:
0.03523788 = score(doc=668,freq=2.0), product of:
0.18215442 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.05201693 = queryNorm
0.19345059 = fieldWeight in 668, 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=668)
0.5 = coord(1/2)
- Abstract
- 20th century massification of higher education and research in academia is said to have produced structurally stratified higher education systems in many countries. Most manifestly, the research mission of universities appears to be divisive. Authors have claimed that the Swedish system, while formally unified, has developed into a binary state, and statistics seem to support this conclusion. This article makes use of a comprehensive statistical data source on Swedish higher education institutions to illustrate stratification, and uses literature on Swedish research policy history to contextualize the statistics. Highlighting the opportunities as well as constraints of the data, the article argues that there is great merit in combining statistics with a qualitative analysis when studying the structural characteristics of national higher education systems. Not least the article shows that it is an over-simplification to describe the Swedish system as binary; the stratification is more complex. On basis of the analysis, the article also argues that while global trends certainly influence national developments, higher education systems have country-specific features that may enrich the understanding of how systems evolve and therefore should be analyzed as part of a broader study of the increasingly globalized academic system.
- Date
- 22. 3.2013 19:43:01
-
Maaten, L. van den: Learning a parametric embedding by preserving local structure (2009)
0.03
0.031216186 = product of:
0.06243237 = sum of:
0.06243237 = product of:
0.12486474 = sum of:
0.12486474 = weight(_text_:t in 3883) [ClassicSimilarity], result of:
0.12486474 = score(doc=3883,freq=8.0), product of:
0.20491594 = queryWeight, product of:
3.9394085 = idf(docFreq=2338, maxDocs=44218)
0.05201693 = queryNorm
0.60934615 = fieldWeight in 3883, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
3.9394085 = idf(docFreq=2338, maxDocs=44218)
0.0546875 = fieldNorm(doc=3883)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Abstract
- The paper presents a new unsupervised dimensionality reduction technique, called parametric t-SNE, that learns a parametric mapping between the high-dimensional data space and the low-dimensional latent space. Parametric t-SNE learns the parametric mapping in such a way that the local structure of the data is preserved as well as possible in the latent space. We evaluate the performance of parametric t-SNE in experiments on three datasets, in which we compare it to the performance of two other unsupervised parametric dimensionality reduction techniques. The results of experiments illustrate the strong performance of parametric t-SNE, in particular, in learning settings in which the dimensionality of the latent space is relatively low.
-
Maaten, L. van den; Hinton, G.: Visualizing data using t-SNE (2008)
0.03
0.027308475 = product of:
0.05461695 = sum of:
0.05461695 = product of:
0.1092339 = sum of:
0.1092339 = weight(_text_:t in 3888) [ClassicSimilarity], result of:
0.1092339 = score(doc=3888,freq=12.0), product of:
0.20491594 = queryWeight, product of:
3.9394085 = idf(docFreq=2338, maxDocs=44218)
0.05201693 = queryNorm
0.53306687 = fieldWeight in 3888, product of:
3.4641016 = tf(freq=12.0), with freq of:
12.0 = termFreq=12.0
3.9394085 = idf(docFreq=2338, maxDocs=44218)
0.0390625 = fieldNorm(doc=3888)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Abstract
- We present a new technique called "t-SNE" that visualizes high-dimensional data by giving each datapoint a location in a two or three-dimensional map. The technique is a variation of Stochastic Neighbor Embedding (Hinton and Roweis, 2002) that is much easier to optimize, and produces significantly better visualizations by reducing the tendency to crowd points together in the center of the map. t-SNE is better than existing techniques at creating a single map that reveals structure at many different scales. This is particularly important for high-dimensional data that lie on several different, but related, low-dimensional manifolds, such as images of objects from multiple classes seen from multiple viewpoints. For visualizing the structure of very large data sets, we show how t-SNE can use random walks on neighborhood graphs to allow the implicit structure of all of the data to influence the way in which a subset of the data is displayed. We illustrate the performance of t-SNE on a wide variety of data sets and compare it with many other non-parametric visualization techniques, including Sammon mapping, Isomap, and Locally Linear Embedding. The visualizations produced by t-SNE are significantly better than those produced by the other techniques on almost all of the data sets.
-
Witten, I.H.; Frank, E.: Data Mining : Praktische Werkzeuge und Techniken für das maschinelle Lernen (2000)
0.03
0.026756732 = product of:
0.053513464 = sum of:
0.053513464 = product of:
0.10702693 = sum of:
0.10702693 = weight(_text_:t in 6833) [ClassicSimilarity], result of:
0.10702693 = score(doc=6833,freq=2.0), product of:
0.20491594 = queryWeight, product of:
3.9394085 = idf(docFreq=2338, maxDocs=44218)
0.05201693 = queryNorm
0.5222967 = fieldWeight in 6833, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.9394085 = idf(docFreq=2338, maxDocs=44218)
0.09375 = fieldNorm(doc=6833)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Footnote
- Rez. in: nfd 52(2001), H.7, S.427-428 (T. Mandl)
-
Chowdhury, G.G.: Template mining for information extraction from digital documents (1999)
0.02
0.024666514 = product of:
0.04933303 = sum of:
0.04933303 = product of:
0.09866606 = sum of:
0.09866606 = weight(_text_:22 in 4577) [ClassicSimilarity], result of:
0.09866606 = score(doc=4577,freq=2.0), product of:
0.18215442 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.05201693 = 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.5 = coord(1/2)
- Date
- 2. 4.2000 18:01:22
-
Maaten, L. van den; Hinton, G.: Visualizing non-metric similarities in multiple maps (2012)
0.02
0.02317201 = product of:
0.04634402 = sum of:
0.04634402 = product of:
0.09268804 = sum of:
0.09268804 = weight(_text_:t in 3884) [ClassicSimilarity], result of:
0.09268804 = score(doc=3884,freq=6.0), product of:
0.20491594 = queryWeight, product of:
3.9394085 = idf(docFreq=2338, maxDocs=44218)
0.05201693 = queryNorm
0.45232224 = fieldWeight in 3884, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
3.9394085 = idf(docFreq=2338, maxDocs=44218)
0.046875 = fieldNorm(doc=3884)
0.5 = coord(1/2)
0.5 = coord(1/2)
- 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.
-
Mandl, T.: Text mining und data minig (2013)
0.02
0.022297276 = product of:
0.044594552 = sum of:
0.044594552 = product of:
0.089189105 = sum of:
0.089189105 = weight(_text_:t in 713) [ClassicSimilarity], result of:
0.089189105 = score(doc=713,freq=2.0), product of:
0.20491594 = queryWeight, product of:
3.9394085 = idf(docFreq=2338, maxDocs=44218)
0.05201693 = queryNorm
0.43524727 = fieldWeight in 713, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.9394085 = idf(docFreq=2338, maxDocs=44218)
0.078125 = fieldNorm(doc=713)
0.5 = coord(1/2)
0.5 = coord(1/2)
-
KDD : techniques and applications (1998)
0.02
0.021142727 = product of:
0.042285454 = sum of:
0.042285454 = product of:
0.08457091 = sum of:
0.08457091 = weight(_text_:22 in 6783) [ClassicSimilarity], result of:
0.08457091 = score(doc=6783,freq=2.0), product of:
0.18215442 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.05201693 = 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.5 = coord(1/2)
- 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
-
Sperlich, T.: ¬Die Zukunft hat schon begonnen : Visualisierungssoftware in der praktischen Anwendung (2000)
0.02
0.01783782 = product of:
0.03567564 = sum of:
0.03567564 = product of:
0.07135128 = sum of:
0.07135128 = weight(_text_:t in 5059) [ClassicSimilarity], result of:
0.07135128 = score(doc=5059,freq=2.0), product of:
0.20491594 = queryWeight, product of:
3.9394085 = idf(docFreq=2338, maxDocs=44218)
0.05201693 = queryNorm
0.34819782 = fieldWeight in 5059, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.9394085 = idf(docFreq=2338, maxDocs=44218)
0.0625 = fieldNorm(doc=5059)
0.5 = coord(1/2)
0.5 = coord(1/2)
-
Brückner, T.; Dambeck, H.: Sortierautomaten : Grundlagen der Textklassifizierung (2003)
0.02
0.01783782 = product of:
0.03567564 = sum of:
0.03567564 = product of:
0.07135128 = sum of:
0.07135128 = weight(_text_:t in 2398) [ClassicSimilarity], result of:
0.07135128 = score(doc=2398,freq=2.0), product of:
0.20491594 = queryWeight, product of:
3.9394085 = idf(docFreq=2338, maxDocs=44218)
0.05201693 = queryNorm
0.34819782 = fieldWeight in 2398, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.9394085 = idf(docFreq=2338, maxDocs=44218)
0.0625 = fieldNorm(doc=2398)
0.5 = coord(1/2)
0.5 = coord(1/2)
-
Baumgartner, R.: Methoden und Werkzeuge zur Webdatenextraktion (2006)
0.02
0.015608093 = product of:
0.031216186 = sum of:
0.031216186 = product of:
0.06243237 = sum of:
0.06243237 = weight(_text_:t in 5808) [ClassicSimilarity], result of:
0.06243237 = score(doc=5808,freq=2.0), product of:
0.20491594 = queryWeight, product of:
3.9394085 = idf(docFreq=2338, maxDocs=44218)
0.05201693 = queryNorm
0.30467308 = fieldWeight in 5808, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.9394085 = idf(docFreq=2338, maxDocs=44218)
0.0546875 = fieldNorm(doc=5808)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Source
- Semantic Web: Wege zur vernetzten Wissensgesellschaft. Hrsg.: T. Pellegrini, u. A. Blumauer
-
Huvila, I.: Mining qualitative data on human information behaviour from the Web (2010)
0.02
0.015608093 = product of:
0.031216186 = sum of:
0.031216186 = product of:
0.06243237 = sum of:
0.06243237 = weight(_text_:t in 4676) [ClassicSimilarity], result of:
0.06243237 = score(doc=4676,freq=2.0), product of:
0.20491594 = queryWeight, product of:
3.9394085 = idf(docFreq=2338, maxDocs=44218)
0.05201693 = queryNorm
0.30467308 = fieldWeight in 4676, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.9394085 = idf(docFreq=2338, maxDocs=44218)
0.0546875 = fieldNorm(doc=4676)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Source
- Information und Wissen: global, sozial und frei? Proceedings des 12. Internationalen Symposiums für Informationswissenschaft (ISI 2011) ; Hildesheim, 9. - 11. März 2011. Hrsg.: J. Griesbaum, T. Mandl u. C. Womser-Hacker
-
Mandl, T.: Text Mining und Data Mining (2023)
0.02
0.015608093 = product of:
0.031216186 = sum of:
0.031216186 = product of:
0.06243237 = sum of:
0.06243237 = weight(_text_:t in 774) [ClassicSimilarity], result of:
0.06243237 = score(doc=774,freq=2.0), product of:
0.20491594 = queryWeight, product of:
3.9394085 = idf(docFreq=2338, maxDocs=44218)
0.05201693 = queryNorm
0.30467308 = fieldWeight in 774, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.9394085 = idf(docFreq=2338, maxDocs=44218)
0.0546875 = fieldNorm(doc=774)
0.5 = coord(1/2)
0.5 = coord(1/2)
-
Information visualization in data mining and knowledge discovery (2002)
0.02
0.01549333 = sum of:
0.008445755 = product of:
0.03378302 = sum of:
0.03378302 = weight(_text_:authors in 1789) [ClassicSimilarity], result of:
0.03378302 = score(doc=1789,freq=4.0), product of:
0.2371355 = queryWeight, product of:
4.558814 = idf(docFreq=1258, maxDocs=44218)
0.05201693 = queryNorm
0.14246294 = fieldWeight in 1789, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
4.558814 = idf(docFreq=1258, maxDocs=44218)
0.015625 = fieldNorm(doc=1789)
0.25 = coord(1/4)
0.0070475754 = product of:
0.014095151 = sum of:
0.014095151 = weight(_text_:22 in 1789) [ClassicSimilarity], result of:
0.014095151 = score(doc=1789,freq=2.0), product of:
0.18215442 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.05201693 = 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)
- Date
- 23. 3.2008 19:10:22
- Footnote
- In 13 chapters, Part Two provides an introduction to KDD, an overview of data mining techniques, and examples of the usefulness of data model visualizations. The importance of visualization throughout the KDD process is stressed in many of the chapters. In particular, the need for measures of visualization effectiveness, benchmarking for identifying best practices, and the use of standardized sample data sets is convincingly presented. Many of the important data mining approaches are discussed in this complementary context. Cluster and outlier detection, classification techniques, and rule discovery algorithms are presented as the basic techniques common to the KDD process. The potential effectiveness of using visualization in the data modeling process are illustrated in chapters focused an using visualization for helping users understand the KDD process, ask questions and form hypotheses about their data, and evaluate the accuracy and veracity of their results. The 11 chapters of Part Three provide an overview of the KDD process and successful approaches to integrating KDD, data mining, and visualization in complementary domains. Rhodes (Chapter 21) begins this section with an excellent overview of the relation between the KDD process and data mining techniques. He states that the "primary goals of data mining are to describe the existing data and to predict the behavior or characteristics of future data of the same type" (p. 281). These goals are met by data mining tasks such as classification, regression, clustering, summarization, dependency modeling, and change or deviation detection. Subsequent chapters demonstrate how visualization can aid users in the interactive process of knowledge discovery by graphically representing the results from these iterative tasks. Finally, examples of the usefulness of integrating visualization and data mining tools in the domain of business, imagery and text mining, and massive data sets are provided. This text concludes with a thorough and useful 17-page index and lengthy yet integrating 17-page summary of the academic and industrial backgrounds of the contributing authors. A 16-page set of color inserts provide a better representation of the visualizations discussed, and a URL provided suggests that readers may view all the book's figures in color on-line, although as of this submission date it only provides access to a summary of the book and its contents. The overall contribution of this work is its focus an bridging two distinct areas of research, making it a valuable addition to the Morgan Kaufmann Series in Database Management Systems. The editors of this text have met their main goal of providing the first textbook integrating knowledge discovery, data mining, and visualization. Although it contributes greatly to our under- standing of the development and current state of the field, a major weakness of this text is that there is no concluding chapter to discuss the contributions of the sum of these contributed papers or give direction to possible future areas of research. "Integration of expertise between two different disciplines is a difficult process of communication and reeducation. Integrating data mining and visualization is particularly complex because each of these fields in itself must draw an a wide range of research experience" (p. 300). Although this work contributes to the crossdisciplinary communication needed to advance visualization in KDD, a more formal call for an interdisciplinary research agenda in a concluding chapter would have provided a more satisfying conclusion to a very good introductory text.
With contributors almost exclusively from the computer science field, the intended audience of this work is heavily slanted towards a computer science perspective. However, it is highly readable and provides introductory material that would be useful to information scientists from a variety of domains. Yet, much interesting work in information visualization from other fields could have been included giving the work more of an interdisciplinary perspective to complement their goals of integrating work in this area. Unfortunately, many of the application chapters are these, shallow, and lack complementary illustrations of visualization techniques or user interfaces used. However, they do provide insight into the many applications being developed in this rapidly expanding field. The authors have successfully put together a highly useful reference text for the data mining and information visualization communities. Those interested in a good introduction and overview of complementary research areas in these fields will be satisfied with this collection of papers. The focus upon integrating data visualization with data mining complements texts in each of these fields, such as Advances in Knowledge Discovery and Data Mining (Fayyad et al., MIT Press) and Readings in Information Visualization: Using Vision to Think (Card et. al., Morgan Kauffman). This unique work is a good starting point for future interaction between researchers in the fields of data visualization and data mining and makes a good accompaniment for a course focused an integrating these areas or to the main reference texts in these fields."
-
Miao, Q.; Li, Q.; Zeng, D.: Fine-grained opinion mining by integrating multiple review sources (2010)
0.01
0.014780071 = product of:
0.029560141 = sum of:
0.029560141 = product of:
0.118240565 = sum of:
0.118240565 = weight(_text_:authors in 4104) [ClassicSimilarity], result of:
0.118240565 = score(doc=4104,freq=4.0), product of:
0.2371355 = queryWeight, product of:
4.558814 = idf(docFreq=1258, maxDocs=44218)
0.05201693 = queryNorm
0.49862027 = fieldWeight in 4104, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
4.558814 = idf(docFreq=1258, maxDocs=44218)
0.0546875 = fieldNorm(doc=4104)
0.25 = coord(1/4)
0.5 = coord(1/2)
- Abstract
- With the rapid development of Web 2.0, online reviews have become extremely valuable sources for mining customers' opinions. Fine-grained opinion mining has attracted more and more attention of both applied and theoretical research. In this article, the authors study how to automatically mine product features and opinions from multiple review sources. Specifically, they propose an integration strategy to solve the issue. Within the integration strategy, the authors mine domain knowledge from semistructured reviews and then exploit the domain knowledge to assist product feature extraction and sentiment orientation identification from unstructured reviews. Finally, feature-opinion tuples are generated. Experimental results on real-world datasets show that the proposed approach is effective.
-
Matson, L.D.; Bonski, D.J.: Do digital libraries need librarians? (1997)
0.01
0.014095151 = product of:
0.028190302 = sum of:
0.028190302 = product of:
0.056380603 = sum of:
0.056380603 = weight(_text_:22 in 1737) [ClassicSimilarity], result of:
0.056380603 = score(doc=1737,freq=2.0), product of:
0.18215442 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.05201693 = 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.5 = coord(1/2)
- Date
- 22.11.1998 18:57:22
-
Lusti, M.: Data Warehousing and Data Mining : Eine Einführung in entscheidungsunterstützende Systeme (1999)
0.01
0.014095151 = product of:
0.028190302 = sum of:
0.028190302 = product of:
0.056380603 = sum of:
0.056380603 = weight(_text_:22 in 4261) [ClassicSimilarity], result of:
0.056380603 = score(doc=4261,freq=2.0), product of:
0.18215442 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.05201693 = 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.5 = coord(1/2)
- Date
- 17. 7.2002 19:22:06
-
Amir, A.; Feldman, R.; Kashi, R.: ¬A new and versatile method for association generation (1997)
0.01
0.014095151 = product of:
0.028190302 = sum of:
0.028190302 = product of:
0.056380603 = sum of:
0.056380603 = weight(_text_:22 in 1270) [ClassicSimilarity], result of:
0.056380603 = score(doc=1270,freq=2.0), product of:
0.18215442 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.05201693 = 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.5 = coord(1/2)
- Source
- Information systems. 22(1997) nos.5/6, S.333-347
