- 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.
Search results
Showing 1 to 10 of 44 (0.058 seconds)Spelling suggestions: "subject:"aanalysis off algorithms"" "subject:"aanalysis off flgorithms""
| 1 |
Subspace clustering for high dimensional categorical data /Gan, Guojun. January 2003 (has links)
Thesis (M.Sc.)--York University, 2003. Graduate Programme in Mathematics and Statistics. / Typescript. Includes bibliographical references (leaves 112-121) and index. Also available on the Internet. MODE OF ACCESS via web browser by entering the following URL:http://gateway.proquest.com/openurl?url%5Fver=Z39.88-2004&res%5Fdat=xri:pqdiss&rft%5Fval%5Ffmt=info:ofi/fmt:kev:mtx:dissertation&rft%5Fdat=xri:pqdiss:MQ99310
|
| 2 |
Subspace clustering based on fuzzy models and mean shifts /Gan, Guojun, January 2007 (has links)
Thesis (Ph.D.)--York University, 2007. Graduate Programme in Mathematics and Statistics. / Typescript. Includes bibliographical references (leaves 192-206) and index. Also available on the Internet. MODE OF ACCESS via web browser by entering the following URL: http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&res_dat=xri:pqdiss&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&rft_dat=xri:pqdiss:NR29494
|
| 3 |
Scalable clustering algorithmsBanerjee, Arindam, Ghosh, Joydeep, January 2005 (has links) (PDF)
Thesis (Ph. D.)--University of Texas at Austin, 2005. / Supervisor: Joydeep Ghosh. Vita. Includes bibliographical references.
|
| 4 |
Semi-supervised clustering probabilistic models, algorithms and experiments /Basu, Sugato. Mooney, Raymond J. January 2005 (has links) (PDF)
Thesis (Ph. D.)--University of Texas at Austin, 2005. / Supervisor: Raymond J. Mooney. Vita. Includes bibliographical references.
|
| 5 |
Robust methods for locating multiple dense regions in complex datasetsGupta, Gunjan Kumar. January 1900 (has links) (PDF)
Thesis (Ph. D.)--University of Texas at Austin, 2006. / Vita. Includes bibliographical references.
|
| 6 |
FRAMEWORK FOR THE ANALYSIS OF EXPERIMENTS INVOLVING HEURISTICS: IMPROVING THE STATE OF THE ARTJAIN, GAGAN 31 March 2004 (has links)
No description available.
|
| 7 |
Mathematical methods for anomaly grouping in hyperspectral images /Doster, Timothy J. January 2009 (has links)
Thesis (M.S.)--Rochester Institute of Technology, 2009. / Typescript. Includes bibliographical references (leaves 85-86).
|
| 8 |
Sensor array optimization application of cluster analysis and genetic algorithms for sensor selection /Sundar, Meghana. January 2007 (has links)
Thesis (M.S.)--State University of New York at Binghamton, Thomas J. Watson School of Engineering and Applied Science, Department of Systems Science and Industrial Engineering, 2007. / Includes bibliographical references.
|
| 9 |
New approaches for robust clustering and for estimating the optimal number of clusters /Frigui, Hichem, January 1997 (has links)
Thesis (Ph. D.)--University of Missouri-Columbia, 1997. / Typescript. Vita. Includes bibliographical references (leaves 190-194). Also available on the Internet.
|
| 10 |
New approaches for robust clustering and for estimating the optimal number of clustersFrigui, Hichem, January 1997 (has links)
Thesis (Ph. D.)--University of Missouri-Columbia, 1997. / Typescript. Vita. Includes bibliographical references (leaves 190-194). Also available on the Internet.
|
Page generated in 0.0628 seconds