Spelling suggestions: "subject:"data mining algorithms"" "subject:"mata mining algorithms""
1 |
Data mining algorithms for genomic analysisAo, Sio-iong. January 2007 (has links)
Thesis (Ph. D.)--University of Hong Kong, 2007. / Title proper from title frame. Also available in printed format.
|
2 |
Mining frequent itemsets and order preserving submatrices from uncertain dataChui, Chun-kit, January 2007 (has links)
Thesis (M. Phil.)--University of Hong Kong, 2008. / Also available in print.
|
3 |
The complexities of tracking quantiles and frequent items in a data streamHung, Yee-shing, Regant. January 2009 (has links)
Thesis (Ph. D.)--University of Hong Kong, 2009. / Includes bibliographical references (p. 122-132) Also available in print.
|
4 |
Mining frequent itemsets and order preserving submatrices from uncertain data /Chui, Chun-kit, January 2007 (has links)
Thesis (M. Phil.)--University of Hong Kong, 2008. / Also available online.
|
5 |
Text subspace clustering with feature weighting and ontologiesJing, Liping. January 2007 (has links)
Thesis (Ph. D.)--University of Hong Kong, 2007. / Title proper from title frame. Also available in printed format.
|
6 |
Finding frequent itemsets over bursty data streamsLin, Hong, Bill. January 2005 (has links)
Thesis (M. Phil.)--University of Hong Kong, 2005. / Title proper from title frame. Also available in printed format.
|
7 |
Efficient decision tree building algorithms for uncertain dataTsang, Pui-kwan, Smith. January 2008 (has links)
Thesis (M. Phil.)--University of Hong Kong, 2009. / Includes bibliographical references (leaves 84-88) Also available in print.
|
8 |
Cluster analysis on uncertain dataNgai, Wang-kay. January 2008 (has links)
Thesis (Ph. D.)--University of Hong Kong, 2009. / Includes bibliographical references (leaf 152-160) Also available in print.
|
9 |
New results on online job scheduling and data stream algorithmsLee, Lap-kei, January 2009 (has links)
Thesis (Ph. D.)--University of Hong Kong, 2009. / Includes bibliographical references (p. 154-162). Also available in print.
|
10 |
Building trajectories through clinical data to model disease progressionLi, Yuanxi January 2013 (has links)
Clinical trials are typically conducted over a population within a defined time period in order to illuminate certain characteristics of a health issue or disease process. These cross-sectional studies provide a snapshot of these disease processes over a large number of people but do not allow us to model the temporal nature of disease, which is essential for modeling detailed prognostic predictions. Longitudinal studies, on the other hand, are used to explore how these processes develop over time in a number of people but can be expensive and time-consuming, and many studies only cover a relatively small window within the disease process. This thesis describes the application of intelligent data analysis techniques for extracting information from time series generated by different diseases. The aim of this thesis is to identify intermediate stages in a disease process and sub-categories of the disease exhibiting subtly different symptoms. It explores the use of a bootstrap technique that fits trajectories through the data generating “pseudo time-series”. It addresses issues including: how clinical variables interact as a disease progresses along the trajectories in the data; and how to automatically identify different disease states along these trajectories, as well as the transitions between them. The thesis documents how reliable time-series models can be created from large amounts of historical cross-sectional data and a novel relabling/latent variable approach has enabled the exploration of the temporal nature of disease progression. The proposed algorithms are tested extensively on simulated data and on three real clinical datasets. Finally, a study is carried out to explore whether we can “calibrate” pseudo time-series models with real longitudinal data in order to improve them. Plausible directions for future research are discussed at the end of the thesis.
|
Page generated in 0.0822 seconds