Sökning: "Minimizing Entropy"

Visar resultat 1 - 5 av 6 uppsatser innehållade orden Minimizing Entropy.

1. 1. Domain Knowledge and Representation Learning for Centroid Initialization in Text Clustering with k-Means : An exploratory study

   Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)

   Författare :David Yu; [2023]
   Nyckelord :Natural language processing; Sentiment analysis; Clustering; Language model; Transformer; Heuristic; Språkteknologi; Sentimentanalys; Klustering; Språkmodell; Transformer; Heuristik;

   Sammanfattning : Text clustering is a problem where texts are partitioned into homogeneous clusters, such as partitioning them based on their sentiment value. Two techniques to address the problem are representation learning, in particular language representation models, and clustering algorithms. LÄS MER

3. 2. Matched Reassignment of the Ultrasound Data of Breast Lesions

   Kandidat-uppsats, Lunds universitet/Matematisk statistik

   Författare :Robert Vujasic; [2022]
   Nyckelord :Mathematics and Statistics;

   Sammanfattning : The goal of this thesis was to, from several randomly selected patients with diagnosed malignant and benign tumors, record optimal lambdas and respective Renyi entropies for each lambda, run a basic statistical analysis of the results and see if there is any significant difference between lambdas/Renyi entropies of malignant and benign lesions.\\ The results showed no significant difference. LÄS MER

4. 3. Summary Statistic Selection with Reinforcement Learning

   Uppsats för yrkesexamina på avancerad nivå, Uppsala universitet/Avdelningen för beräkningsvetenskap

   Författare :Iliam Barkino; [2019]
   Nyckelord :Summary Statistics; Approximate Bayesian Computation; Reinforcement Learning; Machine Learning; Multi-Armed Bandit; Subset Selection; Minimizing Entropy; Approximate Sufficiency; Direct; Halving; SAR; OCBA-m; Racing;

   Sammanfattning : Multi-armed bandit (MAB) algorithms could be used to select a subset of the k most informative summary statistics, from a pool of m possible summary statistics, by reformulating the subset selection problem as a MAB problem. This is suggested by experiments that tested five MAB algorithms (Direct, Halving, SAR, OCBA-m, and Racing) on the reformulated problem and comparing the results to two established subset selection algorithms (Minimizing Entropy and Approximate Sufficiency). LÄS MER

5. 4. Optimization and personalization of a web service based on temporal information

   Uppsats för yrkesexamina på avancerad nivå, Umeå universitet/Institutionen för fysik

   Författare :Jonatan Wallin; [2018]
   Nyckelord :Machine learning;

   Sammanfattning : Development in information and communication technology has increased the attention of personalization in the 21st century and the benefits to both marketers and customers are claimed to be many. The need to efficiently deliver personalized content in different web applications has increased the interest in the field of machine learning. LÄS MER

7. 5. Data Fusion for Consumer Behaviour

   Master-uppsats, KTH/Matematisk statistik

   Författare :Goran Dizdarevic; [2017]
   Nyckelord :;

   Sammanfattning : This thesis analyses different methods of data fusion by fitting a chosen number of statistical models to empirical consumer data and evaluating their performance in terms of a selection of performance measures. The main purpose of the models is to predict business related consumer variables. LÄS MER