Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 27 for “"Instance selection"”.

  1. Instance selection for model-based classifiers

    … helpful and high accuracy classifier difficult. Instance selection addresses some of the issues in a dataset by selecting a subset of the data in such a way that learning from the reduced dataset leads to a better classifier. This work introduces an integer programming formulation of instance …

    iastate Repository record for Instance selection for model-based classifiers (opens in a new tab)

  2. Optimal instance selection for improved decision tree

    <p>Instance selection plays an important role in improving scalability of data mining algorithms, but it can also be used to improve the quality of the data mining results. In this dissertation we present a new optimization-based approach for instance selection that uses a genetic algorithm (GA) to …

    iastate Repository record for Optimal instance selection for improved decision tree (opens in a new tab)

  3. A TIERED RECOMMENDER SYSTEM FOR COST-EFFECTIVE CLOUD INSTANCE SELECTION

    … by the wide range of cloud servers and instances. Due to differences between the cloud server platforms and between instances within the platform, users find it difficult to identify the right instance match for their application. Therefore, we propose the A2Cloud-Hierarchy (A2Cloud-H) …

    u-pacific Repository record for A TIERED RECOMMENDER SYSTEM FOR COST-EFFECTIVE CLOUD INSTANCE SELECTION (opens in a new tab)

  4. Instance selection for simplified decision trees through the generation and selection of instance candidate subsets

    … Methods such as tree pruning, attribute selection, and most recently, instance selection, currently exist to simplify the decision tree structure. We present an alternative instance selection procedure for simplifying decision trees that improves upon previous methods by increasing the …

    iastate Repository record for Instance selection for simplified decision trees through the generation and selection of instance candidate subsets (opens in a new tab)

  5. Leveraging Training Data from High-Resource Languages to Improve Dependency Parsing for Low-Resource Languages

    … resources. My work in this thesis focuses on instance selection, which rests on the assumption, little explored cross-linguistically but well-proven monolingually in domain adaptation, that using less training data that is more relevant to your test case is better than using a full pool of …

    washington Repository record for Leveraging Training Data from High-Resource Languages to Improve Dependency Parsing for Low-Resource Languages (opens in a new tab)

  6. Κατανεμημένη τανυστική αποδόμηση στη μηχανική μάθηση για πλήρως ή μερικώς παρατηρούμενα πολυδιάστατα δεδομένα μεγάλου όγκου

    … propose a classification algorithm for Multiple Instance Learning (MIL) called TensMIL. In TensMIL we propose a new representation of instances by a tensor of order 3 and a method for instance-level features extraction by a CP decomposition, from fully or partially observed data. TensMIL is …

    greece Repository record for Κατανεμημένη τανυστική αποδόμηση στη μηχανική μάθηση για πλήρως ή μερικώς παρατηρούμενα πολυδιάστατα δεδομένα μεγάλου όγκου (opens in a new tab)

  7. A PROBABILISTIC MACHINE LEARNING FRAMEWORK FOR CLOUD RESOURCE SELECTION ON THE CLOUD

    … memory-intensive, and compute-intensive Cloud instances for the execution of scientific applications. The scientific community, especially small research institutions and undergraduate universities, face many hurdles while conducting high-performance computing research in the absence of large …

    u-pacific Repository record for A PROBABILISTIC MACHINE LEARNING FRAMEWORK FOR CLOUD RESOURCE SELECTION ON THE CLOUD (opens in a new tab)

  8. LINKING ENTITIES TO A KNOWLEDGE BASE

    … This thesis proposes annotation acquisition, instance selection, topic model and lazy learning for entity linking. Finally, I also propose a framework for entity linking in microblog.

    nus Repository record for LINKING ENTITIES TO A KNOWLEDGE BASE (opens in a new tab) Download file for LINKING ENTITIES TO A KNOWLEDGE BASE (opens in a new tab)

  9. Hybrid classification approach for imbalanced datasets

    … (Synthetic Minority Over-sampling Technique) and instance selection approaches. The numeric results show that the proposed combination approach can help classifiers to achieve better performance.</p>

    iastate Repository record for Hybrid classification approach for imbalanced datasets (opens in a new tab)

  10. A balanced approach to the multi-class imbalance problem

    … use of class balance accuracy outperforms model selection based on regular accuracy. The measure is then invoked in two novel applications, one as the maximization criteria in the instance selection biased sampling technique and the other as a model selection tool in a multiple classifier system …

    iastate Repository record for A balanced approach to the multi-class imbalance problem (opens in a new tab)

  11. EVENT COREFERENCE RESOLUTION

    … event and object Coreference pairs with new instance selection strategy and new linguistic features. Competing classifiers and topic-related event-detection are further imposed to enhance mention-pair resolvers. Second, two global solutions, spectral graph partitioning and random walk model, …

    nus Repository record for EVENT COREFERENCE RESOLUTION (opens in a new tab) Download file for EVENT COREFERENCE RESOLUTION (opens in a new tab)

  12. Development and evaluation of machine learning algorithms for biomedical applications

    … problem, the dissertation presents (i) an instance selection technique and hybrid method for drug sensitivity prediction; (ii) a link prediction approach to drug sensitivity prediction; a noise-filtering method for drug sensitivity prediction; and (iv) transfer learning approaches for …

    njit Repository record for Development and evaluation of machine learning algorithms for biomedical applications (opens in a new tab)

  13. Application of data mining in scheduling of single machine system

    … to find a heuristic solution to the optimal instances selection problem, and then induce a decision tree from this subset of instances. The optimal instance selection can be viewed as determining the best practices from what has been done in the past, and the data mining can then learn new …

    iastate Repository record for Application of data mining in scheduling of single machine system (opens in a new tab)

  14. Large-margin representation learning for small-size datasets

    … set of CLs with a global average pooling; ii) an instance selection method to choose anchors and instances of interest; iii) a loss function to induce the weight update of the CLs; iv) a large-margin discriminant. Images are provided to the CLs to generate a latent representation and then used to …

    ets-quebec Download PDF for Large-margin representation learning for small-size datasets (opens in a new tab)

  15. Técnicas de redução de instâncias: ATISA e SSMA2

    … primeira delas, ATISA (Adaptive Threshold-based Instance Selection Algorithm), mantém instâncias com base em um critério que usa a distância de cada instância ao seu inimigo mais próximo como um limiar. Essa característica prioriza instâncias próximas às fronteiras de decisão, que são mais …

    brazil-ufpe Repository record for Técnicas de redução de instâncias: ATISA e SSMA2 (opens in a new tab)

  16. Learning SAT Encodings for Constraint Satisfaction Problems

    … problems (CSPs) is by translating them into instances of the Boolean Satisfiability Problem (SAT). For some global constraints in CSPs there exist many algorithms which encode the constraint into SAT; choosing an appropriate SAT encoding can alter the ultimate solving time dramatically. We …

    whiterose Download PDF for Learning SAT Encodings for Constraint Satisfaction Problems (opens in a new tab)

  17. Automatic Segmentation and Classification of Cervical Accelerometry Signals: Towards the Instrumental Detection of Unsafe Swallowing

    … and speech. Using binary genetic feature selection and a support vector machine, the proposed system achieved a cough detection accuracy of 99.26±0.12% when discriminating between instructed cough and rest state accelerometry signals. An accuracy of 90±13.9% was achieved using elastic net …

    toronto-retro Repository record for Automatic Segmentation and Classification of Cervical Accelerometry Signals: Towards the Instrumental Detection of Unsafe Swallowing (opens in a new tab)

  18. MODELING DYNAMIC ASPECTS OF CONTEXT-AWARE RECOMMENDER SYSTEMS

    … contextual conditions to select discriminative instances (i.e., user interactions) from a stream of incoming instances. We aim to make the online updating process efficient via selecting the best instances while reducing the impact of information loss. Secondly, we present how to efficiently …

    nus Repository record for MODELING DYNAMIC ASPECTS OF CONTEXT-AWARE RECOMMENDER SYSTEMS (opens in a new tab) Download file for MODELING DYNAMIC ASPECTS OF CONTEXT-AWARE RECOMMENDER SYSTEMS (opens in a new tab)

Page 1 of 2