Search (39 results, page 1 of 2)

  • × theme_ss:"Data Mining"
  1. Vaughan, L.; Chen, Y.: Data mining from web search queries : a comparison of Google trends and Baidu index (2015) 0.04 
    0.03819228 = product of:
  0.07638456 = sum of:
    0.06049643 = weight(_text_:services in 1605) [ClassicSimilarity], result of:
      0.06049643 = score(doc=1605,freq=6.0), product of:
        0.17221296 = queryWeight, product of:
          3.6713707 = idf(docFreq=3057, maxDocs=44218)
          0.046906993 = queryNorm
        0.3512885 = fieldWeight in 1605, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          3.6713707 = idf(docFreq=3057, maxDocs=44218)
          0.0390625 = fieldNorm(doc=1605)
    0.015888125 = product of:
      0.03177625 = sum of:
        0.03177625 = weight(_text_:22 in 1605) [ClassicSimilarity], result of:
          0.03177625 = score(doc=1605,freq=2.0), product of:
            0.1642603 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.046906993 = queryNorm
            0.19345059 = fieldWeight in 1605, 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=1605)
      0.5 = coord(1/2)
  0.5 = coord(2/4)
    Abstract
    Numerous studies have explored the possibility of uncovering information from web search queries but few have examined the factors that affect web query data sources. We conducted a study that investigated this issue by comparing Google Trends and Baidu Index. Data from these two services are based on queries entered by users into Google and Baidu, two of the largest search engines in the world. We first compared the features and functions of the two services based on documents and extensive testing. We then carried out an empirical study that collected query volume data from the two sources. We found that data from both sources could be used to predict the quality of Chinese universities and companies. Despite the differences between the two services in terms of technology, such as differing methods of language processing, the search volume data from the two were highly correlated and combining the two data sources did not improve the predictive power of the data. However, there was a major difference between the two in terms of data availability. Baidu Index was able to provide more search volume data than Google Trends did. Our analysis showed that the disadvantage of Google Trends in this regard was due to Google's smaller user base in China. The implication of this finding goes beyond China. Google's user bases in many countries are smaller than that in China, so the search volume data related to those countries could result in the same issue as that related to China.
    Source
    Journal of the Association for Information Science and Technology. 66(2015) no.1, S.13-22
  2. Lusti, M.: Data Warehousing and Data Mining : Eine Einführung in entscheidungsunterstützende Systeme (1999) 0.02 
    0.024486296 = product of:
  0.09794518 = sum of:
    0.09794518 = sum of:
      0.047103178 = weight(_text_:management in 4261) [ClassicSimilarity], result of:
        0.047103178 = score(doc=4261,freq=2.0), product of:
          0.15810528 = queryWeight, product of:
            3.3706124 = idf(docFreq=4130, maxDocs=44218)
            0.046906993 = queryNorm
          0.29792285 = fieldWeight in 4261, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.3706124 = idf(docFreq=4130, maxDocs=44218)
            0.0625 = fieldNorm(doc=4261)
      0.050842002 = weight(_text_:22 in 4261) [ClassicSimilarity], result of:
        0.050842002 = score(doc=4261,freq=2.0), product of:
          0.1642603 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.046906993 = 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.25 = coord(1/4)
    Date
    17. 7.2002 19:22:06
    Theme
    Information Resources Management
  3. Lackes, R.; Tillmanns, C.: Data Mining für die Unternehmenspraxis : Entscheidungshilfen und Fallstudien mit führenden Softwarelösungen (2006) 0.02 
    0.01836472 = product of:
  0.07345888 = sum of:
    0.07345888 = sum of:
      0.035327382 = weight(_text_:management in 1383) [ClassicSimilarity], result of:
        0.035327382 = score(doc=1383,freq=2.0), product of:
          0.15810528 = queryWeight, product of:
            3.3706124 = idf(docFreq=4130, maxDocs=44218)
            0.046906993 = queryNorm
          0.22344214 = fieldWeight in 1383, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.3706124 = idf(docFreq=4130, maxDocs=44218)
            0.046875 = fieldNorm(doc=1383)
      0.038131498 = weight(_text_:22 in 1383) [ClassicSimilarity], result of:
        0.038131498 = score(doc=1383,freq=2.0), product of:
          0.1642603 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.046906993 = queryNorm
          0.23214069 = fieldWeight in 1383, 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=1383)
  0.25 = coord(1/4)
    Abstract
    Das Buch richtet sich an Praktiker in Unternehmen, die sich mit der Analyse von großen Datenbeständen beschäftigen. Nach einem kurzen Theorieteil werden vier Fallstudien aus dem Customer Relationship Management eines Versandhändlers bearbeitet. Dabei wurden acht führende Softwarelösungen verwendet: der Intelligent Miner von IBM, der Enterprise Miner von SAS, Clementine von SPSS, Knowledge Studio von Angoss, der Delta Miner von Bissantz, der Business Miner von Business Object und die Data Engine von MIT. Im Rahmen der Fallstudien werden die Stärken und Schwächen der einzelnen Lösungen deutlich, und die methodisch-korrekte Vorgehensweise beim Data Mining wird aufgezeigt. Beides liefert wertvolle Entscheidungshilfen für die Auswahl von Standardsoftware zum Data Mining und für die praktische Datenanalyse.
    Date
    22. 3.2008 14:46:06
  4. 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.01241504 = product of:
  0.04966016 = sum of:
    0.04966016 = sum of:
      0.030594414 = weight(_text_:management in 1833) [ClassicSimilarity], result of:
        0.030594414 = score(doc=1833,freq=6.0), product of:
          0.15810528 = queryWeight, product of:
            3.3706124 = idf(docFreq=4130, maxDocs=44218)
            0.046906993 = queryNorm
          0.19350658 = fieldWeight in 1833, product of:
            2.4494898 = tf(freq=6.0), with freq of:
              6.0 = termFreq=6.0
            3.3706124 = idf(docFreq=4130, maxDocs=44218)
            0.0234375 = fieldNorm(doc=1833)
      0.019065749 = weight(_text_:22 in 1833) [ClassicSimilarity], result of:
        0.019065749 = score(doc=1833,freq=2.0), product of:
          0.1642603 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.046906993 = 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.25 = coord(1/4)
    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
    LCSH
    Information technology / Management / Congresses
    Subject
    Information technology / Management / Congresses
  5. Chen, C.-C.; Chen, A.-P.: Using data mining technology to provide a recommendation service in the digital library (2007) 0.01 
    0.012348781 = product of:
  0.049395125 = sum of:
    0.049395125 = weight(_text_:services in 2533) [ClassicSimilarity], result of:
      0.049395125 = score(doc=2533,freq=4.0), product of:
        0.17221296 = queryWeight, product of:
          3.6713707 = idf(docFreq=3057, maxDocs=44218)
          0.046906993 = queryNorm
        0.28682584 = fieldWeight in 2533, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.6713707 = idf(docFreq=3057, maxDocs=44218)
          0.0390625 = fieldNorm(doc=2533)
  0.25 = coord(1/4)
    Abstract
    Purpose - Since library storage has been increasing day by day, it is difficult for readers to find the books which interest them as well as representative booklists. How to utilize meaningful information effectively to improve the service quality of the digital library appears to be very important. The purpose of this paper is to provide a recommendation system architecture to promote digital library services in electronic libraries. Design/methodology/approach - In the proposed architecture, a two-phase data mining process used by association rule and clustering methods is designed to generate a recommendation system. The process considers not only the relationship of a cluster of users but also the associations among the information accessed. Findings - The process considered not only the relationship of a cluster of users but also the associations among the information accessed. With the advanced filter, the recommendation supported by the proposed system architecture would be closely served to meet users' needs. Originality/value - This paper not only constructs a recommendation service for readers to search books from the web but takes the initiative in finding the most suitable books for readers as well. Furthermore, library managers are expected to purchase core and hot books from a limited budget to maintain and satisfy the requirements of readers along with promoting digital library services.
  6. Chowdhury, G.G.: Template mining for information extraction from digital documents (1999) 0.01 
    0.0111216875 = product of:
  0.04448675 = sum of:
    0.04448675 = product of:
      0.0889735 = sum of:
        0.0889735 = weight(_text_:22 in 4577) [ClassicSimilarity], result of:
          0.0889735 = score(doc=4577,freq=2.0), product of:
            0.1642603 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.046906993 = 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.25 = coord(1/4)
    Date
    2. 4.2000 18:01:22
  7. Sun, X.; Lin, H.: Topical community detection from mining user tagging behavior and interest (2013) 0.01 
    0.010478289 = product of:
  0.041913155 = sum of:
    0.041913155 = weight(_text_:services in 605) [ClassicSimilarity], result of:
      0.041913155 = score(doc=605,freq=2.0), product of:
        0.17221296 = queryWeight, product of:
          3.6713707 = idf(docFreq=3057, maxDocs=44218)
          0.046906993 = queryNorm
        0.2433798 = fieldWeight in 605, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.6713707 = idf(docFreq=3057, maxDocs=44218)
          0.046875 = fieldNorm(doc=605)
  0.25 = coord(1/4)
    Abstract
    With the development of Web2.0, social tagging systems in which users can freely choose tags to annotate resources according to their interests have attracted much attention. In particular, literature on the emergence of collective intelligence in social tagging systems has increased. In this article, we propose a probabilistic generative model to detect latent topical communities among users. Social tags and resource contents are leveraged to model user interest in two similar and correlated ways. Our primary goal is to capture user tagging behavior and interest and discover the emergent topical community structure. The communities should be groups of users with frequent social interactions as well as similar topical interests, which would have important research implications for personalized information services. Experimental results on two real social tagging data sets with different genres have shown that the proposed generative model more accurately models user interest and detects high-quality and meaningful topical communities.
  8. KDD : techniques and applications (1998) 0.01 
    0.009532874 = product of:
  0.038131498 = sum of:
    0.038131498 = product of:
      0.076262996 = sum of:
        0.076262996 = weight(_text_:22 in 6783) [ClassicSimilarity], result of:
          0.076262996 = score(doc=6783,freq=2.0), product of:
            0.1642603 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.046906993 = 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.25 = coord(1/4)
    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
  9. Lischka, K.: Spurensuche im Datenwust : Data-Mining-Software fahndet nach kriminellen Mitarbeitern, guten Kunden - und bald vielleicht auch nach Terroristen (2002) 0.01 
    0.00918236 = product of:
  0.03672944 = sum of:
    0.03672944 = sum of:
      0.017663691 = weight(_text_:management in 1178) [ClassicSimilarity], result of:
        0.017663691 = score(doc=1178,freq=2.0), product of:
          0.15810528 = queryWeight, product of:
            3.3706124 = idf(docFreq=4130, maxDocs=44218)
            0.046906993 = queryNorm
          0.11172107 = fieldWeight in 1178, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.3706124 = idf(docFreq=4130, maxDocs=44218)
            0.0234375 = fieldNorm(doc=1178)
      0.019065749 = weight(_text_:22 in 1178) [ClassicSimilarity], result of:
        0.019065749 = score(doc=1178,freq=2.0), product of:
          0.1642603 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.046906993 = queryNorm
          0.116070345 = fieldWeight in 1178, 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=1178)
  0.25 = coord(1/4)
    Content
    "Ob man als Terrorist einen Anschlag gegen die Vereinigten Staaten plant, als Kassierer Scheine aus der Kasse unterschlägt oder für bestimmte Produkte besonders gerne Geld ausgibt - einen Unterschied macht Data-Mining-Software da nicht. Solche Programme analysieren riesige Daten- mengen und fällen statistische Urteile. Mit diesen Methoden wollen nun die For- scher des "Information Awaren in den Vereinigten Staaten Spuren von Terroristen in den Datenbanken von Behörden und privaten Unternehmen wie Kreditkartenfirmen finden. 200 Millionen Dollar umfasst der Jahresetat für die verschiedenen Forschungsprojekte. Dass solche Software in der Praxis funktioniert, zeigen die steigenden Umsätze der Anbieter so genannter Customer-Relationship-Management-Software. Im vergangenen Jahr ist das Potenzial für analytische CRM-Anwendungen laut dem Marktforschungsinstitut IDC weltweit um 22 Prozent gewachsen, bis zum Jahr 2006 soll es in Deutschland mit einem jährlichen Plus von 14,1 Prozent so weitergehen. Und das trotz schwacher Konjunktur - oder gerade deswegen. Denn ähnlich wie Data-Mining der USRegierung helfen soll, Terroristen zu finden, entscheiden CRM-Programme heute, welche Kunden für eine Firma profitabel sind. Und welche es künftig sein werden, wie Manuela Schnaubelt, Sprecherin des CRM-Anbieters SAP, beschreibt: "Die Kundenbewertung ist ein zentraler Bestandteil des analytischen CRM. Sie ermöglicht es Unternehmen, sich auf die für sie wichtigen und richtigen Kunden zu fokussieren. Darüber hinaus können Firmen mit speziellen Scoring- Verfahren ermitteln, welche Kunden langfristig in welchem Maße zum Unternehmenserfolg beitragen." Die Folgen der Bewertungen sind für die Betroffenen nicht immer positiv: Attraktive Kunden profitieren von individuellen Sonderangeboten und besonderer Zuwendung. Andere hängen vielleicht so lauge in der Warteschleife des Telefonservice, bis die profitableren Kunden abgearbeitet sind. So könnte eine praktische Umsetzung dessen aussehen, was SAP-Spreche-rin Schnaubelt abstrakt beschreibt: "In vielen Unternehmen wird Kundenbewertung mit der klassischen ABC-Analyse durchgeführt, bei der Kunden anhand von Daten wie dem Umsatz kategorisiert werden. A-Kunden als besonders wichtige Kunden werden anders betreut als C-Kunden." Noch näher am geplanten Einsatz von Data-Mining zur Terroristenjagd ist eine Anwendung, die heute viele Firmen erfolgreich nutzen: Sie spüren betrügende Mitarbeiter auf. Werner Sülzer vom großen CRM-Anbieter NCR Teradata beschreibt die Möglichkeiten so: "Heute hinterlässt praktisch jeder Täter - ob Mitarbeiter, Kunde oder Lieferant - Datenspuren bei seinen wirtschaftskriminellen Handlungen. Es muss vorrangig darum gehen, einzelne Spuren zu Handlungsmustern und Täterprofilen zu verdichten. Das gelingt mittels zentraler Datenlager und hoch entwickelter Such- und Analyseinstrumente." Von konkreten Erfolgen sprich: Entlas-sungen krimineller Mitarbeiter-nach Einsatz solcher Programme erzählen Unternehmen nicht gerne. Matthias Wilke von der "Beratungsstelle für Technologiefolgen und Qualifizierung" (BTQ) der Gewerkschaft Verdi weiß von einem Fall 'aus der Schweiz. Dort setzt die Handelskette "Pick Pay" das Programm "Lord Lose Prevention" ein. Zwei Monate nach Einfüh-rung seien Unterschlagungen im Wert von etwa 200 000 Franken ermittelt worden. Das kostete mehr als 50 verdächtige Kassiererinnen und Kassierer den Job.
  10. Ku, L.-W.; Chen, H.-H.: Mining opinions from the Web : beyond relevance retrieval (2007) 0.01 
    0.008731907 = product of:
  0.03492763 = sum of:
    0.03492763 = weight(_text_:services in 605) [ClassicSimilarity], result of:
      0.03492763 = score(doc=605,freq=2.0), product of:
        0.17221296 = queryWeight, product of:
          3.6713707 = idf(docFreq=3057, maxDocs=44218)
          0.046906993 = queryNorm
        0.2028165 = fieldWeight in 605, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.6713707 = idf(docFreq=3057, maxDocs=44218)
          0.0390625 = fieldNorm(doc=605)
  0.25 = coord(1/4)
    Abstract
    Documents discussing public affairs, common themes, interesting products, and so on, are reported and distributed on the Web. Positive and negative opinions embedded in documents are useful references and feedbacks for governments to improve their services, for companies to market their products, and for customers to purchase their objects. Web opinion mining aims to extract, summarize, and track various aspects of subjective information on the Web. Mining subjective information enables traditional information retrieval (IR) systems to retrieve more data from human viewpoints and provide information with finer granularity. Opinion extraction identifies opinion holders, extracts the relevant opinion sentences, and decides their polarities. Opinion summarization recognizes the major events embedded in documents and summarizes the supportive and the nonsupportive evidence. Opinion tracking captures subjective information from various genres and monitors the developments of opinions from spatial and temporal dimensions. To demonstrate and evaluate the proposed opinion mining algorithms, news and bloggers' articles are adopted. Documents in the evaluation corpora are tagged in different granularities from words, sentences to documents. In the experiments, positive and negative sentiment words and their weights are mined on the basis of Chinese word structures. The f-measure is 73.18% and 63.75% for verbs and nouns, respectively. Utilizing the sentiment words mined together with topical words, we achieve f-measure 62.16% at the sentence level and 74.37% at the document level.
  11. Information visualization in data mining and knowledge discovery (2002) 0.01 
    0.007340997 = product of:
  0.029363988 = sum of:
    0.029363988 = sum of:
      0.016653487 = weight(_text_:management in 1789) [ClassicSimilarity], result of:
        0.016653487 = score(doc=1789,freq=4.0), product of:
          0.15810528 = queryWeight, product of:
            3.3706124 = idf(docFreq=4130, maxDocs=44218)
            0.046906993 = queryNorm
          0.10533164 = fieldWeight in 1789, product of:
            2.0 = tf(freq=4.0), with freq of:
              4.0 = termFreq=4.0
            3.3706124 = idf(docFreq=4130, maxDocs=44218)
            0.015625 = fieldNorm(doc=1789)
      0.0127105005 = weight(_text_:22 in 1789) [ClassicSimilarity], result of:
        0.0127105005 = score(doc=1789,freq=2.0), product of:
          0.1642603 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.046906993 = 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.25 = coord(1/4)
    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.
    Series
    Morgan Kaufmann series in data management systems
  12. Cohen, D.J.: From Babel to knowledge : data mining large digital collections (2006) 0.01 
    0.006985526 = product of:
  0.027942104 = sum of:
    0.027942104 = weight(_text_:services in 1178) [ClassicSimilarity], result of:
      0.027942104 = score(doc=1178,freq=2.0), product of:
        0.17221296 = queryWeight, product of:
          3.6713707 = idf(docFreq=3057, maxDocs=44218)
          0.046906993 = queryNorm
        0.1622532 = fieldWeight in 1178, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.6713707 = idf(docFreq=3057, maxDocs=44218)
          0.03125 = fieldNorm(doc=1178)
  0.25 = coord(1/4)
    Abstract
    In Jorge Luis Borges's curious short story The Library of Babel, the narrator describes an endless collection of books stored from floor to ceiling in a labyrinth of countless hexagonal rooms. The pages of the library's books seem to contain random sequences of letters and spaces; occasionally a few intelligible words emerge in the sea of paper and ink. Nevertheless, readers diligently, and exasperatingly, scan the shelves for coherent passages. The narrator himself has wandered numerous rooms in search of enlightenment, but with resignation he simply awaits his death and burial - which Borges explains (with signature dark humor) consists of being tossed unceremoniously over the library's banister. Borges's nightmare, of course, is a cursed vision of the research methods of disciplines such as literature, history, and philosophy, where the careful reading of books, one after the other, is supposed to lead inexorably to knowledge and understanding. Computer scientists would approach Borges's library far differently. Employing the information theory that forms the basis for search engines and other computerized techniques for assessing in one fell swoop large masses of documents, they would quickly realize the collection's incoherence though sampling and statistical methods - and wisely start looking for the library's exit. These computational methods, which allow us to find patterns, determine relationships, categorize documents, and extract information from massive corpuses, will form the basis for new tools for research in the humanities and other disciplines in the coming decade. For the past three years I have been experimenting with how to provide such end-user tools - that is, tools that harness the power of vast electronic collections while hiding much of their complicated technical plumbing. In particular, I have made extensive use of the application programming interfaces (APIs) the leading search engines provide for programmers to query their databases directly (from server to server without using their web interfaces). In addition, I have explored how one might extract information from large digital collections, from the well-curated lexicographic database WordNet to the democratic (and poorly curated) online reference work Wikipedia. While processing these digital corpuses is currently an imperfect science, even now useful tools can be created by combining various collections and methods for searching and analyzing them. And more importantly, these nascent services suggest a future in which information can be gleaned from, and sense can be made out of, even imperfect digital libraries of enormous scale. A brief examination of two approaches to data mining large digital collections hints at this future, while also providing some lessons about how to get there.
  13. Survey of text mining : clustering, classification, and retrieval (2004) 0.01 
    0.0063738357 = product of:
  0.025495343 = sum of:
    0.025495343 = product of:
      0.050990686 = sum of:
        0.050990686 = weight(_text_:management in 804) [ClassicSimilarity], result of:
          0.050990686 = score(doc=804,freq=6.0), product of:
            0.15810528 = queryWeight, product of:
              3.3706124 = idf(docFreq=4130, maxDocs=44218)
              0.046906993 = queryNorm
            0.32251096 = fieldWeight in 804, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              3.3706124 = idf(docFreq=4130, maxDocs=44218)
              0.0390625 = fieldNorm(doc=804)
      0.5 = coord(1/2)
  0.25 = coord(1/4)
    Abstract
    Extracting content from text continues to be an important research problem for information processing and management. Approaches to capture the semantics of text-based document collections may be based on Bayesian models, probability theory, vector space models, statistical models, or even graph theory. As the volume of digitized textual media continues to grow, so does the need for designing robust, scalable indexing and search strategies (software) to meet a variety of user needs. Knowledge extraction or creation from text requires systematic yet reliable processing that can be codified and adapted for changing needs and environments. This book will draw upon experts in both academia and industry to recommend practical approaches to the purification, indexing, and mining of textual information. It will address document identification, clustering and categorizing documents, cleaning text, and visualizing semantic models of text.
    Classification
    ST 270 Informatik / Monographien / Software und -entwicklung / Datenbanken, Datenbanksysteme, Data base management, Informationssysteme
    RVK
    ST 270 Informatik / Monographien / Software und -entwicklung / Datenbanken, Datenbanksysteme, Data base management, Informationssysteme
  14. Matson, L.D.; Bonski, D.J.: Do digital libraries need librarians? (1997) 0.01 
    0.0063552503 = product of:
  0.025421001 = sum of:
    0.025421001 = product of:
      0.050842002 = sum of:
        0.050842002 = weight(_text_:22 in 1737) [ClassicSimilarity], result of:
          0.050842002 = score(doc=1737,freq=2.0), product of:
            0.1642603 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.046906993 = 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.25 = coord(1/4)
    Date
    22.11.1998 18:57:22
  15. Amir, A.; Feldman, R.; Kashi, R.: ¬A new and versatile method for association generation (1997) 0.01 
    0.0063552503 = product of:
  0.025421001 = sum of:
    0.025421001 = product of:
      0.050842002 = sum of:
        0.050842002 = weight(_text_:22 in 1270) [ClassicSimilarity], result of:
          0.050842002 = score(doc=1270,freq=2.0), product of:
            0.1642603 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.046906993 = 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.25 = coord(1/4)
    Source
    Information systems. 22(1997) nos.5/6, S.333-347
  16. Data mining : Theoretische Aspekte und Anwendungen (1998) 0.01 
    0.005887897 = product of:
  0.023551589 = sum of:
    0.023551589 = product of:
      0.047103178 = sum of:
        0.047103178 = weight(_text_:management in 966) [ClassicSimilarity], result of:
          0.047103178 = score(doc=966,freq=2.0), product of:
            0.15810528 = queryWeight, product of:
              3.3706124 = idf(docFreq=4130, maxDocs=44218)
              0.046906993 = queryNorm
            0.29792285 = fieldWeight in 966, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.3706124 = idf(docFreq=4130, maxDocs=44218)
              0.0625 = fieldNorm(doc=966)
      0.5 = coord(1/2)
  0.25 = coord(1/4)
    Theme
    Information Resources Management
  17. Analytische Informationssysteme : Data Warehouse, On-Line Analytical Processing, Data Mining (1998) 0.01 
    0.005887897 = product of:
  0.023551589 = sum of:
    0.023551589 = product of:
      0.047103178 = sum of:
        0.047103178 = weight(_text_:management in 1380) [ClassicSimilarity], result of:
          0.047103178 = score(doc=1380,freq=2.0), product of:
            0.15810528 = queryWeight, product of:
              3.3706124 = idf(docFreq=4130, maxDocs=44218)
              0.046906993 = queryNorm
            0.29792285 = fieldWeight in 1380, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.3706124 = idf(docFreq=4130, maxDocs=44218)
              0.0625 = fieldNorm(doc=1380)
      0.5 = coord(1/2)
  0.25 = coord(1/4)
    Theme
    Information Resources Management
  18. Hofstede, A.H.M. ter; Proper, H.A.; Van der Weide, T.P.: Exploiting fact verbalisation in conceptual information modelling (1997) 0.01 
    0.0055608437 = product of:
  0.022243375 = sum of:
    0.022243375 = product of:
      0.04448675 = sum of:
        0.04448675 = weight(_text_:22 in 2908) [ClassicSimilarity], result of:
          0.04448675 = score(doc=2908,freq=2.0), product of:
            0.1642603 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.046906993 = queryNorm
            0.2708308 = fieldWeight in 2908, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0546875 = fieldNorm(doc=2908)
      0.5 = coord(1/2)
  0.25 = coord(1/4)
    Source
    Information systems. 22(1997) nos.5/6, S.349-385
  19. Classification, automation, and new media : Proceedings of the 24th Annual Conference of the Gesellschaft für Klassifikation e.V., University of Passau, March 15 - 17, 2000 (2002) 0.01 
    0.005204215 = product of:
  0.02081686 = sum of:
    0.02081686 = product of:
      0.04163372 = sum of:
        0.04163372 = weight(_text_:management in 5997) [ClassicSimilarity], result of:
          0.04163372 = score(doc=5997,freq=4.0), product of:
            0.15810528 = queryWeight, product of:
              3.3706124 = idf(docFreq=4130, maxDocs=44218)
              0.046906993 = queryNorm
            0.2633291 = fieldWeight in 5997, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.3706124 = idf(docFreq=4130, maxDocs=44218)
              0.0390625 = fieldNorm(doc=5997)
      0.5 = coord(1/2)
  0.25 = coord(1/4)
    Abstract
    Given the huge amount of information in the internet and in practically every domain of knowledge that we are facing today, knowledge discovery calls for automation. The book deals with methods from classification and data analysis that respond effectively to this rapidly growing challenge. The interested reader will find new methodological insights as well as applications in economics, management science, finance, and marketing, and in pattern recognition, biology, health, and archaeology.
    Content
    Data Analysis, Statistics, and Classification.- Pattern Recognition and Automation.- Data Mining, Information Processing, and Automation.- New Media, Web Mining, and Automation.- Applications in Management Science, Finance, and Marketing.- Applications in Medicine, Biology, Archaeology, and Others.- Author Index.- Subject Index.
  20. Knowledge management in fuzzy databases (2000) 0.01 
    0.00515191 = product of:
  0.02060764 = sum of:
    0.02060764 = product of:
      0.04121528 = sum of:
        0.04121528 = weight(_text_:management in 4260) [ClassicSimilarity], result of:
          0.04121528 = score(doc=4260,freq=2.0), product of:
            0.15810528 = queryWeight, product of:
              3.3706124 = idf(docFreq=4130, maxDocs=44218)
              0.046906993 = queryNorm
            0.2606825 = fieldWeight in 4260, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.3706124 = idf(docFreq=4130, maxDocs=44218)
              0.0546875 = fieldNorm(doc=4260)
      0.5 = coord(1/2)
  0.25 = coord(1/4)

Authors

Years

Languages

  • e 29
  • d 10

Types

Themes

Subjects

Classifications