• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 19691
  • 3373
  • 2417
  • 2015
  • 1551
  • 1432
  • 881
  • 406
  • 390
  • 359
  • 297
  • 237
  • 208
  • 208
  • 208
  • Tagged with
  • 38217
  • 12470
  • 9257
  • 7123
  • 6700
  • 5896
  • 5307
  • 5203
  • 4740
  • 3461
  • 3307
  • 2834
  • 2730
  • 2546
  • 2117
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
41

A study on quantitative association rules

王漣, Wang, Lian. January 1999 (has links)
published_or_final_version / Computer Science and Information Systems / Master / Master of Philosophy
42

Gaining Strategic Advantage through Bibliomining: Data Mining for Management Decisions in Corporate, Special, Digital, and Traditional Libraries

Nicholson, Scott, Stanton, Jeffrey M. January 2003 (has links)
Library and information services in corporations, schools, universities, and communities capture information about their users, circulation history, resources in the collection, and search patterns (Koenig, 1985). Unfortunately, few libraries have taken advantage of these data as a way to improve customer service, manage acquisition budgets, or influence strategic decision-making about uses of information in their organizations. In this chapter, we present a global view of the data generated in libraries and the variety of decisions that those data can inform. We describe ways in which library and information managers can use data mining in their libraries, i.e. bibliomining, to understand patterns of behavior among library users and staff members and patterns of information resource use throughout the institution. The chapter examines data sources and possible applications of data mining techniques and explores the legal and ethical implications of data mining in libraries.
43

A punched tape comparator

Mueller, Arno Victor Albert 08 1900 (has links)
No description available.
44

Data center migration

Wiswell, Shane. January 2007 (has links) (PDF)
Thesis (M.S.C.I.T.)--Regis University, Denver, Colo., 2007. / Title from PDF title page (viewed on Jan 17, 2008). Includes bibliographical references.
45

Memory- and knowledge-conscious data mining

Ghoting, Amol, January 2007 (has links)
Thesis (Ph. D.)--Ohio State University, 2007. / Title from first page of PDF file. Includes bibliographical references (p. 153-162).
46

Multi-relational data mining /

Knobbe, Arno J. January 2007 (has links)
Zugl.: Diss.
47

Sequential pattern detection and time series models for predicting IED attacks

Stafford, William B. January 2009 (has links) (PDF)
Thesis (M.S. in Information Technology Management)--Naval Postgraduate School, March 2009. / Thesis Advisor(s): Kamel, Magdi. "March 2009." Description based on title screen as viewed on April 24, 2009. Author(s) subject terms: Sequential Pattern Detection, Time Series, Predicting IED Attacks, Data Mining. Includes bibliographical references (p. 77). Also available in print.
48

Managing the cost of usable data centers

Khantaphixay, Sisomphone. January 2007 (has links) (PDF)
Thesis (M.S.C.I.T.)--Regis University, Denver, Colo., 2008. / Title from PDF title page (viewed on June 10, 2008). Includes bibliographical references.
49

Performance of ad hoc queries using data correlation

Unrein, Lawrence C. January 2007 (has links)
Thesis (M.S.)--University of Wyoming, 2007. / Title from PDF title page (viewed on June 16, 2008). Includes bibliographical references (p. 59-60).
50

The Design and development of a data warehouse using sales database and requirements of a retail group/

Güratan, Işıl. Aytaç, Sıtkı January 2005 (has links) (PDF)
Thesis (Master)--İzmir Institute of Technology, İzmir, 2005 / Includes bibliographical references (leaves 99-101).

Page generated in 0.0691 seconds