Search (19 results, page 1 of 1)

  • × theme_ss:"Data Mining"
  1. Chen, C.-C.; Chen, A.-P.: Using data mining technology to provide a recommendation service in the digital library (2007) 0.03 
    0.02643904 = product of:
  0.1321952 = sum of:
    0.1321952 = weight(_text_:books in 2533) [ClassicSimilarity], result of:
      0.1321952 = score(doc=2533,freq=8.0), product of:
        0.24756333 = queryWeight, product of:
          4.8330836 = idf(docFreq=956, maxDocs=44218)
          0.051222645 = queryNorm
        0.5339854 = fieldWeight in 2533, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          4.8330836 = idf(docFreq=956, maxDocs=44218)
          0.0390625 = fieldNorm(doc=2533)
  0.2 = coord(1/5)
    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.
  2. Chowdhury, G.G.: Template mining for information extraction from digital documents (1999) 0.02 
    0.019431893 = product of:
  0.09715946 = sum of:
    0.09715946 = weight(_text_:22 in 4577) [ClassicSimilarity], result of:
      0.09715946 = score(doc=4577,freq=2.0), product of:
        0.17937298 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.051222645 = 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.2 = coord(1/5)
    Date
    2. 4.2000 18:01:22
  3. Cohen, D.J.: From Babel to knowledge : data mining large digital collections (2006) 0.02 
    0.018317504 = product of:
  0.09158752 = sum of:
    0.09158752 = weight(_text_:books in 1178) [ClassicSimilarity], result of:
      0.09158752 = score(doc=1178,freq=6.0), product of:
        0.24756333 = queryWeight, product of:
          4.8330836 = idf(docFreq=956, maxDocs=44218)
          0.051222645 = queryNorm
        0.36995593 = fieldWeight in 1178, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          4.8330836 = idf(docFreq=956, maxDocs=44218)
          0.03125 = fieldNorm(doc=1178)
  0.2 = coord(1/5)
    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.
  4. KDD : techniques and applications (1998) 0.02 
    0.016655907 = product of:
  0.083279535 = sum of:
    0.083279535 = weight(_text_:22 in 6783) [ClassicSimilarity], result of:
      0.083279535 = score(doc=6783,freq=2.0), product of:
        0.17937298 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.051222645 = 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.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
  5. Organisciak, P.; Schmidt, B.M.; Downie, J.S.: Giving shape to large digital libraries through exploratory data analysis (2022) 0.02 
    0.015863424 = product of:
  0.079317115 = sum of:
    0.079317115 = weight(_text_:books in 473) [ClassicSimilarity], result of:
      0.079317115 = score(doc=473,freq=2.0), product of:
        0.24756333 = queryWeight, product of:
          4.8330836 = idf(docFreq=956, maxDocs=44218)
          0.051222645 = queryNorm
        0.3203912 = fieldWeight in 473, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.8330836 = idf(docFreq=956, maxDocs=44218)
          0.046875 = fieldNorm(doc=473)
  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.
  6. Matson, L.D.; Bonski, D.J.: Do digital libraries need librarians? (1997) 0.01 
    0.011103938 = product of:
  0.055519693 = sum of:
    0.055519693 = weight(_text_:22 in 1737) [ClassicSimilarity], result of:
      0.055519693 = score(doc=1737,freq=2.0), product of:
        0.17937298 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.051222645 = 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.2 = coord(1/5)
    Date
    22.11.1998 18:57:22
  7. Lusti, M.: Data Warehousing and Data Mining : Eine Einführung in entscheidungsunterstützende Systeme (1999) 0.01 
    0.011103938 = product of:
  0.055519693 = sum of:
    0.055519693 = weight(_text_:22 in 4261) [ClassicSimilarity], result of:
      0.055519693 = score(doc=4261,freq=2.0), product of:
        0.17937298 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.051222645 = 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.2 = coord(1/5)
    Date
    17. 7.2002 19:22:06
  8. Amir, A.; Feldman, R.; Kashi, R.: ¬A new and versatile method for association generation (1997) 0.01 
    0.011103938 = product of:
  0.055519693 = sum of:
    0.055519693 = weight(_text_:22 in 1270) [ClassicSimilarity], result of:
      0.055519693 = score(doc=1270,freq=2.0), product of:
        0.17937298 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.051222645 = 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.2 = coord(1/5)
    Source
    Information systems. 22(1997) nos.5/6, S.333-347
  9. Hofstede, A.H.M. ter; Proper, H.A.; Van der Weide, T.P.: Exploiting fact verbalisation in conceptual information modelling (1997) 0.01 
    0.009715946 = product of:
  0.04857973 = sum of:
    0.04857973 = weight(_text_:22 in 2908) [ClassicSimilarity], result of:
      0.04857973 = score(doc=2908,freq=2.0), product of:
        0.17937298 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.051222645 = 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.2 = coord(1/5)
    Source
    Information systems. 22(1997) nos.5/6, S.349-385
  10. Lackes, R.; Tillmanns, C.: Data Mining für die Unternehmenspraxis : Entscheidungshilfen und Fallstudien mit führenden Softwarelösungen (2006) 0.01 
    0.0083279535 = product of:
  0.041639768 = sum of:
    0.041639768 = weight(_text_:22 in 1383) [ClassicSimilarity], result of:
      0.041639768 = score(doc=1383,freq=2.0), product of:
        0.17937298 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.051222645 = 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.2 = coord(1/5)
    Date
    22. 3.2008 14:46:06
  11. Hallonsten, O.; Holmberg, D.: Analyzing structural stratification in the Swedish higher education system : data contextualization with policy-history analysis (2013) 0.01 
    0.006939962 = product of:
  0.03469981 = sum of:
    0.03469981 = weight(_text_:22 in 668) [ClassicSimilarity], result of:
      0.03469981 = score(doc=668,freq=2.0), product of:
        0.17937298 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.051222645 = 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.2 = coord(1/5)
    Date
    22. 3.2013 19:43:01
  12. Vaughan, L.; Chen, Y.: Data mining from web search queries : a comparison of Google trends and Baidu index (2015) 0.01 
    0.006939962 = product of:
  0.03469981 = sum of:
    0.03469981 = weight(_text_:22 in 1605) [ClassicSimilarity], result of:
      0.03469981 = score(doc=1605,freq=2.0), product of:
        0.17937298 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.051222645 = 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.2 = coord(1/5)
    Source
    Journal of the Association for Information Science and Technology. 66(2015) no.1, S.13-22
  13. Fonseca, F.; Marcinkowski, M.; Davis, C.: Cyber-human systems of thought and understanding (2019) 0.01 
    0.006939962 = product of:
  0.03469981 = sum of:
    0.03469981 = weight(_text_:22 in 5011) [ClassicSimilarity], result of:
      0.03469981 = score(doc=5011,freq=2.0), product of:
        0.17937298 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.051222645 = queryNorm
        0.19345059 = fieldWeight in 5011, 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=5011)
  0.2 = coord(1/5)
    Date
    7. 3.2019 16:32:22
  14. Peters, G.; Gaese, V.: ¬Das DocCat-System in der Textdokumentation von G+J (2003) 0.01 
    0.005551969 = product of:
  0.027759846 = sum of:
    0.027759846 = weight(_text_:22 in 1507) [ClassicSimilarity], result of:
      0.027759846 = score(doc=1507,freq=2.0), product of:
        0.17937298 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.051222645 = queryNorm
        0.15476047 = fieldWeight in 1507, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.03125 = fieldNorm(doc=1507)
  0.2 = coord(1/5)
    Date
    22. 4.2003 11:45:36
  15. Hölzig, C.: Google spürt Grippewellen auf : Die neue Anwendung ist bisher auf die USA beschränkt (2008) 0.01 
    0.005551969 = product of:
  0.027759846 = sum of:
    0.027759846 = weight(_text_:22 in 2403) [ClassicSimilarity], result of:
      0.027759846 = score(doc=2403,freq=2.0), product of:
        0.17937298 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.051222645 = queryNorm
        0.15476047 = fieldWeight in 2403, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.03125 = fieldNorm(doc=2403)
  0.2 = coord(1/5)
    Date
    3. 5.1997 8:44:22
  16. Jäger, L.: Von Big Data zu Big Brother (2018) 0.01 
    0.005551969 = product of:
  0.027759846 = sum of:
    0.027759846 = weight(_text_:22 in 5234) [ClassicSimilarity], result of:
      0.027759846 = score(doc=5234,freq=2.0), product of:
        0.17937298 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.051222645 = queryNorm
        0.15476047 = fieldWeight in 5234, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.03125 = fieldNorm(doc=5234)
  0.2 = coord(1/5)
    Date
    22. 1.2018 11:33:49
  17. Lischka, K.: Spurensuche im Datenwust : Data-Mining-Software fahndet nach kriminellen Mitarbeitern, guten Kunden - und bald vielleicht auch nach Terroristen (2002) 0.00 
    0.0041639768 = product of:
  0.020819884 = sum of:
    0.020819884 = weight(_text_:22 in 1178) [ClassicSimilarity], result of:
      0.020819884 = score(doc=1178,freq=2.0), product of:
        0.17937298 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.051222645 = 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.2 = coord(1/5)
    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.
  18. 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.00 
    0.0041639768 = product of:
  0.020819884 = sum of:
    0.020819884 = weight(_text_:22 in 1833) [ClassicSimilarity], result of:
      0.020819884 = score(doc=1833,freq=2.0), product of:
        0.17937298 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.051222645 = 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)
    Date
    11. 5.2008 19:49:22
  19. Information visualization in data mining and knowledge discovery (2002) 0.00 
    0.0027759846 = product of:
  0.013879923 = sum of:
    0.013879923 = weight(_text_:22 in 1789) [ClassicSimilarity], result of:
      0.013879923 = score(doc=1789,freq=2.0), product of:
        0.17937298 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.051222645 = 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.2 = coord(1/5)
    Date
    23. 3.2008 19:10:22

Authors

Years

Languages

  • e 12
  • d 7

Types

Themes

Subjects

Classifications