Дисертації з теми "Hidden Data Mining"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-17 дисертацій для дослідження на тему "Hidden Data Mining".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте дисертації для різних дисциплін та оформлюйте правильно вашу бібліографію.
Liu, Tantan. "Data Mining over Hidden Data Sources." The Ohio State University, 2012. http://rave.ohiolink.edu/etdc/view?acc_num=osu1343313341.
Повний текст джерелаDharmavaram, Sirisha. "Mining Biomedical Data for Hidden Relationship Discovery." Thesis, University of North Texas, 2019. https://digital.library.unt.edu/ark:/67531/metadc1538709/.
Повний текст джерелаLiu, Zhenjiao. "Incomplete multi-view data clustering with hidden data mining and fusion techniques." Electronic Thesis or Diss., Institut polytechnique de Paris, 2023. http://www.theses.fr/2023IPPAS011.
Повний текст джерелаIncomplete multi-view data clustering is a research direction that attracts attention in the fields of data mining and machine learning. In practical applications, we often face situations where only part of the modal data can be obtained or there are missing values. Data fusion is an important method for incomplete multi-view information mining. Solving incomplete multi-view information mining in a targeted manner, achieving flexible collaboration between visible views and shared hidden views, and improving the robustness have become quite challenging. This thesis focuses on three aspects: hidden data mining, collaborative fusion, and enhancing the robustness of clustering. The main contributions are as follows:1. Hidden data mining for incomplete multi-view data: existing algorithms cannot make full use of the observation of information within and between views, resulting in the loss of a large amount of valuable information, and so we propose a new incomplete multi-view clustering model IMC-NLT (Incomplete Multi-view Clustering Based on NMF and Low-Rank Tensor Fusion) based on non-negative matrix factorization and low-rank tensor fusion. IMC-NLT first uses a low-rank tensor to retain view features with a unified dimension. Using a consistency measure, IMC-NLT captures a consistent representation across multiple views. Finally, IMC-NLT incorporates multiple learning into a unified model such that hidden information can be extracted effectively from incomplete views. We conducted comprehensive experiments on five real-world datasets to validate the performance of IMC-NLT. The overall experimental results demonstrate that the proposed IMC-NLT performs better than several baseline methods, yielding stable and promising results.2. Collaborative fusion for incomplete multi-view data: our approach to address this issue is Incomplete Multi-view Co-Clustering by Sparse Low-Rank Representation (CCIM-SLR). The algorithm is based on sparse low-rank representation and subspace representation, in which jointly missing data is filled using data within a modality and related data from other modalities. To improve the stability of clustering results for multi-view data with different missing degrees, CCIM-SLR uses the Γ-norm model, which is an adjustable low-rank representation method. CCIM-SLR can alternate between learning the shared hidden view, visible view, and cluster partitions within a co-learning framework. An iterative algorithm with guaranteed convergence is used to optimize the proposed objective function. Compared with other baseline models, CCIM-SLR achieved the best performance in the comprehensive experiments on the five benchmark datasets, particularly on those with varying degrees of incompleteness.3. Enhancing the clustering robustness for incomplete multi-view data: we offer a fusion of graph convolution and information bottlenecks (Incomplete Multi-view Representation Learning Through Anchor Graph-based GCN and Information Bottleneck - IMRL-AGI). First, we introduce the information bottleneck theory to filter out the noise data with irrelevant details and retain only the most relevant feature items. Next, we integrate the graph structure information based on anchor points into the local graph information of the state fused into the shared information representation and the information representation learning process of the local specific view, a process that can balance the robustness of the learned features and improve the robustness. Finally, the model integrates multiple representations with the help of information bottlenecks, reducing the impact of redundant information in the data. Extensive experiments are conducted on several real-world datasets, and the results demonstrate the superiority of IMRL-AGI. Specifically, IMRL-AGI shows significant improvements in clustering and classification accuracy, even in the presence of high view missing rates (e.g. 10.23% and 24.1% respectively on the ORL dataset)
Peng, Yingli. "Improvement of Data Mining Methods on Falling Detection and Daily Activities Recognition." Thesis, Mittuniversitetet, Avdelningen för informations- och kommunikationssystem, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:miun:diva-25521.
Повний текст джерелаYang, Yimin. "Exploring Hidden Coherent Feature Groups and Temporal Semantics for Multimedia Big Data Analysis." FIU Digital Commons, 2015. http://digitalcommons.fiu.edu/etd/2254.
Повний текст джерелаSajeva, Lisa. "Predizione del tempo rimanente di vita di un impianto mediante Hidden Markow Model." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2017. http://amslaurea.unibo.it/13846/.
Повний текст джерелаVitali, Federico. "Map-Matching su Piattaforma BigData." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2019. http://amslaurea.unibo.it/18089/.
Повний текст джерелаEng, Catherine. "Développement de méthodes de fouille de données basées sur les modèles de Markov cachés du second ordre pour l'identification d'hétérogénéités dans les génomes bactériens." Thesis, Nancy 1, 2010. http://www.theses.fr/2010NAN10041/document.
Повний текст джерелаSecond-order Hidden Markov Models (HMM2) are stochastic processes with a high efficiency in exploring bacterial genome sequences. Different types of HMM2 (M1M2, M2M2, M2M0) combined to combinatorial methods were developed in a new approach to discriminate genomic regions without a priori knowledge on their genetic content. This approach was applied on two bacterial models in order to validate its achievements: Streptomyces coelicolor and Streptococcus thermophilus. These bacterial species exhibit distinct genomic traits (base composition, global genome size) in relation with their ecological niche: soil for S. coelicolor and dairy products for S. thermophilus. In S. coelicolor, a first HMM2 architecture allowed the detection of short discrete DNA heterogeneities (5-16 nucleotides in size), mostly localized in intergenic regions. The application of the method on a biologically known gene set, the SigR regulon (involved in oxidative stress response), proved the efficiency in identifying bacterial promoters. S. coelicolor shows a complex regulatory network (up to 12% of the genes may be involved in gene regulation) with more than 60 sigma factors, involved in initiation of transcription. A classification method coupled to a searching algorithm (i.e. R’MES) was developed to automatically extract the box1-spacer-box2 composite DNA motifs, structure corresponding to the typical bacterial promoter -35/-10 boxes. Among the 814 DNA motifs described for the whole S. coelicolor genome, those of sigma factors (B, WhiG) could be retrieved from the crude data. We could show that this method could be generalized by applying it successfully in a preliminary attempt to the genome of Bacillus subtilis
陳迪祥. "A Data Mining Approach to Eliciting Hidden Relationships from Disease Data." Thesis, 2003. http://ndltd.ncl.edu.tw/handle/33856707588342488454.
Повний текст джерела國立暨南國際大學
資訊管理學系
91
Data mining is able to find some unobvious or hidden information from data and it is what the managers of hospitals need for their rich data. There are many kinds of data in those hospitals’ database, such as records of emergency treatment, records of outpatient services, records of examining patients, and records of taking medicines. The data is helpful for exploring medical knowledge by data mining technology. This paper describes a data mining system which processing the standard health insurance files defined by Bureau of National Health Insurance. The system uses FP-Tree for good performance of mining. A distributed and caching architecture has been implemented in the system to balance the loading of mining. Users can acquire mining results from the system quickly. The system will elicit hidden relationships within diseases from those health insurance files. Our frequent patterns also include conditional probabilities that certain diseases may happen if the patient has some disease. Doctors and researchers operate the system by a browser. The mining results discovered by the system will help doctors and researchers with medical researches. Keywords: Data mining, Health Insurance, Medicine, Distributed Architecture
Yu, Zhun. "Mining Hidden Knowledge from Measured Data for Improving Building Energy Performance." Thesis, 2012. http://spectrum.library.concordia.ca/973713/1/Yu_PhD_S2012.pdf.
Повний текст джерела"Spatio-Temporal Data Mining to Detect Changes and Clusters in Trajectories." Doctoral diss., 2012. http://hdl.handle.net/2286/R.I.15907.
Повний текст джерелаDissertation/Thesis
Ph.D. Industrial Engineering 2012
Shao, Qun, Raymond C. Rowe, and Peter York. "Data mining of fractured experimental data using neurofuzzy logic-discovering and integrating knowledge hidden in multiple formulation databases for a fluid-bed granulation process." 2008. http://hdl.handle.net/10454/3439.
Повний текст джерелаIn the pharmaceutical field, current practice in gaining process understanding by data analysis or knowledge discovery has generally focused on dealing with single experimental databases. This limits the level of knowledge extracted in the situation where data from a number of sources, so called fractured data, contain interrelated information. This situation is particularly relevant for complex processes involving a number of operating variables, such as a fluid-bed granulation. This study investigated three data mining strategies to discover and integrate knowledge "hidden" in a number of small experimental databases for a fluid-bed granulation process using neurofuzzy logic technology. Results showed that more comprehensive domain knowledge was discovered from multiple databases via an appropriate data mining strategy. This study also demonstrated that the textual information excluded in individual databases was a critical parameter and often acted as the precondition for integrating knowledge extracted from different databases. Consequently generic knowledge of the domain was discovered, leading to an improved understanding of the granulation process.
Laxman, Srivatsan. "Discovering Frequent Episodes : Fast Algorithms, Connections With HMMs And Generalizations." Thesis, 2006. https://etd.iisc.ac.in/handle/2005/375.
Повний текст джерелаLaxman, Srivatsan. "Discovering Frequent Episodes : Fast Algorithms, Connections With HMMs And Generalizations." Thesis, 2006. http://hdl.handle.net/2005/375.
Повний текст джерелаAkhlaghi, Arash. "A Framework for Discovery and Diagnosis of Behavioral Transitions in Event-streams." 2013. http://scholarworks.gsu.edu/cs_diss/81.
Повний текст джерелаSaradha, R. "Malware Analysis using Profile Hidden Markov Models and Intrusion Detection in a Stream Learning Setting." Thesis, 2014. http://etd.iisc.ac.in/handle/2005/3129.
Повний текст джерелаSaradha, R. "Malware Analysis using Profile Hidden Markov Models and Intrusion Detection in a Stream Learning Setting." Thesis, 2014. http://hdl.handle.net/2005/3129.
Повний текст джерела