The thesis deals with web analytics of content based websites. Its primary aim is to design metrics of a web analysis and range of the metrics. This allows a proprietor of the content based websites to evaluate the state of the web and also its changes. The following is a practical example of handling website metrics and how to evaluate a web redesign with the help of these metrics. The first and second chapter lists literature of web analysis and specifies a purpose of the thesis and its target group. In the paragraphs that follow, I explain the theoretical starting-points and major concepts in further detail. In the third chapter I describe the main targets of content based websites because con-sequently defined metrics should reflect these targets and aim for them. Then I underline some specific problems of content based websites analysis. The fifth chapter forms the crux of this work. First, I define right metrics and then present the very design of metrics for analysis of content based websites. The proposed metrics describe interpretation of values, possibilities of segmentation and also relation to other metrics. In the fifth chapter there is an example of some metrics applied to real data of two content based websites with a description of how to work with these metrics.

O aumento da geração e do intercâmbio de imagens médicas digitais tem incentivado profissionais da computação a criarem ferramentas para manipulação, armazenamento e busca por similaridade dessas imagens. As ferramentas de recuperação de imagens por conteúdo, foco desse trabalho, têm a função de auxiliar na tomada de decisão e na prática da medicina baseada em estudo de casos semelhantes. Porém, seus principais obstáculos são conseguir uma rápida recuperação de imagens armazenadas em grandes bases e reduzir o gap semântico, caracterizado pela divergência entre o resultado obtido pelo computador e aquele esperado pelo médico. No presente trabalho, uma análise das funções de distância e dos descritores computacionais de características está sendo realizada com o objetivo de encontrar uma aproximação eficiente entre os métodos de extração de características de baixo nível e os parâmetros de percepção do médico (de alto nível) envolvidos na análise de imagens. O trabalho de integração desses três elementos (Extratores de Características, Função de Distância e Parâmetro Perceptual) resultou na criação de operadores de similaridade, que podem ser utilizados para aproximar o sistema computacional ao usuário final, visto que serão recuperadas imagens de acordo com a percepção de similaridade do médico, usuário final do sistema / The continuous growth of the medical images generation and their use in the day-to-day procedures in hospitals and medical centers has motivated the computer science researchers to develop algorithms, methods and tools to store, search and retrieve images by their content. Therefore, the content-based image retrieval (CBIR) field is also growing at a very fast pace. Algorithms and tools for CBIR, which are at the core of this work, can help on the decision making process when the specialist is composing the images analysis. This is based on the fact that the specialist can retrieve similar cases to the one under evaluation. However, the main reservation about the use of CBIR is to achieve a fast and effective retrieval, in the sense that the specialist gets what is expected for. That is, the problem is to bridge the semantic gap given by the divergence among the result automatically delivered by the system and what the user is expecting. In this work it is proposed the perceptual parameter, which adds to the relationship between the feature extraction algorithms and distance functions aimed at finding the best combination to deliver to the user what he/she expected from the query. Therefore, this research integrated the three main elements of similarity queries: the image features, the distance function and the perceptual parameter, what resulted in searching operators. The experiments performed show that these operators can narrow the distance between the system and the specialist, contributing to bridge the semantic gap

The news landscape has changed during recent years because of the digitization. News can nowadays be found in both newspapers and on different sites online. The availability of the digital newspapers leads to competition among the news companies. To make the users stay on one specific platform for news, relevance is required in the content and oneway of creating relevance is through personalization, to tailor the content to each user. The focus of this thesis is therefore personalizing newspush notifications for a digital  newspaper and making them more relevant for users. The project was made in cooperation with VK Media, and their digital newspaper. The task in this thesis is to implement personalization of push notifications by building a recommendation system and to test the implemented system with data from VK. In order to perform the task, a dataset representing reading habits of VK’s users was extracted from their data warehouse. Then a user-based and content-based recommendation system was implemented in Python.The idea with the system is to recommend new articles that are sufficiently similar to one or more of the already read articles. Articles that may be liked by one of the most similar users should also be recommended. Finally, the system’s performance was evaluated with the data representing reading habits for VK’s users. The results show that the implemented system has better performance than the current solution without any personalization, when recommending a few articles to each user. The results from the evaluation also show that the more articles the users have read, the better predictions are possible to make. Thus, this thesis offers a first step towards meeting the expectations of more relevant content among VK’s users.

Recommendation Systems or Recommender Systems have become widely popular due to surge of information at present time and consumer centric environment. Researchers have looked into a wide range of recommendation systems leveraging a wide range of algorithms. This study investigates three popular recommendation systems in existence, Collaborative Filtering, Content-Based Filtering, and Hybrid recommendation system. The famous MovieLens dataset was utilized for the purpose of this study. The evaluation looked into both quantitative and qualitative aspects of the recommendation systems. We found that from both the perspectives, the hybrid recommendation system performs comparatively better than standalone Collaborative Filtering or Content-Based Filtering recommendation system

Many employment services base their online job recommendations to users based solely on explicit data in their profiles. The implicit data of what users for example click on, save and mark as irrelevant goes unused. Instead of making recommendations based on user behavior they make a direct comparison between user preferences and job ad attributes. A reason for this is the concern that the inclusion of implicit data can give odd recommendations resulting in a loss of credibility for the service. However, as research has shown this to be of great advantage to recommender systems. In this paper I implement a job recommender and test it both with user data including interaction history with job ads as well as with only explicit data. The results of the recommender with implicit data got better overall performance, but negligible gain in the ratio between true and false positives, or in other words the ratio between correct and incorrect recommendations.

Recommender System is a tool helping users find content and overcome information overload. It predicts interests of users and makes recommendation according to the interest model of users. The original content-based recommender system is the continuation and development of collaborative filtering, which doesn’t need the user’s evaluation for items. Instead, the similarity is calculated based on the information of items that are chose by users, and then make the recommendation accordingly. With the improvement of machine learning, current content-based recommender system can build profile for users and products respectively. Building or updating the profile according to the analysis of items that are bought or visited by users. The system can compare the user and the profile of items and then recommend the most similar products. So this recommender method that compare user and product directly cannot be brought into collaborative filtering model. The foundation of content-based algorithm is acquisition and quantitative analysis of the content. As the research of acquisition and filtering of text information are mature, many current content-based recommender systems make recommendation according to the analysis of text information. This paper introduces content-based recommender system for the movie website of VionLabs. There are a lot of features extracted from the movie, they are diversity and unique, which is also the difference from other recommender systems. We use these features to construct movie model and calculate similarity. We introduce a new approach for setting weight of features, which improves the representative of movies. Finally we evaluate the approach to illustrate the improvement. / Recommender System är ett verktyg som hjälper användarna att hitta innehåll och övervinna informationsöverflöd. Det förutspår användarnas intressen och gör rekommendation enligt räntemodellen användare. Den ursprungliga innehållsbaserade recommender är en fortsättning och utveckling av samarbete filtrering, som inte behöver användarens utvärdering artiklar. Istället är likheten beräknas baserat på informationen objekt som har varit valde av användare, och sedan göra rekommendationen därefter. Med förbättringen av maskininlärning, kan nuvarande innehållsbaserad recommender systemet bygga profil för användare och produkt respektive. Bygga eller uppdatera profilen enligt analysen av objekt som köps eller besöks av användare. Systemet kan jämföra användaren och profilen av artiklar och rekommendera den mest liknande produkt. Så här recommender metod som jämför användaren och produkten direkt kan inte föras in collaborative filtreringsmodell. Grunden för innehållsbaserad algoritm är förvärv och kvantitativ analys av innehållet. Eftersom forskning förvärv och filtrering av textinformation är mogen, många aktuella innehållsbaserade recommender system gör rekommendation enligt analysen av textinformation. Denna uppsats införa innehållsbaserad recommender system för film webbplats VionLabs. Det finns en mängd funktioner som extraherats från en film, är de mångfald och unik, vilket är också skillnaden med andra recommender system. Vi använder dessa funktioner för att konstruera film vektor och beräkna likheter. Vi introducerar en ny metod för att fastställa vikten av funktioner, vilket förbättrar företrädare för filmer. Slutligen utvärderar vi tillvägagångssättet för att illustrera förbättringen.

With a multitude of images available on the Internet, how do we find what we are looking for? This project tries to determine how much the precision and recall of search queries is improved by using a word taxonomy on traditional Text-Based Image Search and Content-Based Image Search. By applying a word taxonomy to different data sources, a strong keyword filter and a keyword extender were implemented and tested. The results show that depending on the implementation, the precision or the recall can be increased. By using a similar approach on real life implementations, it is possible to force images with higher precisions to the front while keeping a high recall value, thus increasing the experienced relevance of image search. / Med den mängd bilder som nu finns tillgänglig på Internet, hur kan vi fortfarande hitta det vi letar efter? Denna uppsats försöker avgöra hur mycket bildprecision och bildåterkallning kan öka med hjälp av appliceringen av en ordtaxonomi på traditionell Text-Based Image Search och Content-Based Image Search. Genom att applicera en ordtaxonomi på olika datakällor kan ett starkt ordfilter samt en modul som förlänger ordlistor skapas och testas. Resultaten pekar på att beroende på implementationen så kan antingen precisionen eller återkallningen förbättras. Genom att använda en liknande metod i ett verkligt scenario är det därför möjligt att flytta bilder med hög precision längre fram i resultatlistan och samtidigt behålla hög återkallning, och därmed öka den upplevda relevansen i bildsök.

With an overwhelming number of movies available globally, it can be a daunting task for users to find movies that cater to their individual preferences. The vast selection can often leave people feeling overwhelmed, making it challenging to pick a suitable movie. As a result, movie service providers need to offer a recommendation system that adds value to their customers. A movie recommendation system can help customers in this regard by providing a process that assists in finding movies that match their preferences. Previous studies on recommendation systems that use Machine Learning (ML) algorithms have demonstrated that these algorithms outperform some of the existing recommendation methods regarding recommendation strategy. However, there is still room for further improvement, especially when it comes to exploring scenarios where users need to spend a considerable amount of time finding movies related to their preferred genres. This prolonged search for the right movies can give rise to problems such as data sparsity and cold start. To address these issues, we propose a machine learning-based recommender system for movie genres using the K-nearest Neighbours (KNN) algorithm. Our final system utilizes a slider bar on a Streamlit web app, allowing users to select their preferred movies and see recommendations for similar movies. By incorporating user preferences, our system provides personalized recommendations that are more likely to meet the user's interests and preferences. To address our research question: “How and to what extent can a machine learning-based recommender system be developed focusing on movie genres where movie popularity can be predicted based on its content?” we propose three main research objectives. Firstly, we investigate the employment of a classification algorithm in recommending movies focusing on interest genres. Secondly, we evaluate the performance of our classification algorithm concerning movie viewers. Thirdly, we represent the popularity of movie genres based on the content and investigate how this representation can inform the movie recommendation algorithm. On the heels of an experimental strategy, we extract and pre-process a dataset of movies and their associated genre labels from Kaggle. The dataset consists of two files derived from The Movie Database (TMDB) 5000 Movie Dataset. We develop a machine learning-based recommender system based on the similarity of movie genres using the extracted and pre-processed dataset. We vary the KNN algorithm with a slider bar to recommend movies of varying similarity to the selected movie, ranging from similar to diverse in genre. This approach can suggest movies with different titles for users with diverse preferences. We evaluate the performance of the KNN classification algorithm using a user's interest genres, measuring its accuracy, precision, recall, and F1-score. The algorithm's accuracy ranges from low to moderate across different values of K, indicating its moderate effectiveness in predicting user preferences. The algorithm's precision ranges from moderate to high, implying that it provides accurate recommendations to the user. The recall score improves with increasing K and reaches its maximum at K=15, demonstrating its ability to retrieve relevant recommendations. The algorithm achieves a good balance between precision and recall, with an average F1-score of 0.60. This means that the algorithm can accurately identify relevant movies and recommend them to users with a high degree of accuracy. Furthermore, our result shows that the popularity visualization technique using KNN is a powerful tool for analysing and understanding the popularity of different movie genres, which can inform important decisions related to marketing, distribution, and production in the movie industry. In conclusion, our machine learning-based recommender system using KNN for movie genres is a game changer. It allows users to select their preferred movies and see recommendations for similar movies using a slider bar on a Streamlit web app. If confirmed by future research, the promising findings of this thesis can pave the way for developing and incorporating other classification algorithms and features for movie recommendation and evaluation. Furthermore, the adjustable slider bar ranges on the Streamlit web app allow users to customize their movie preferences and receive tailored recommendations.

Content and language integrated learning is an approach to learning a language while studying subject matter, as well as the other way round. The intention with this dissertation has been to gather insights into teachers‘ perceptions regarding this approach and pupils’ perceived views regarding working with subject matter through the medium of English. Previous research within this area of study has shown that using this approach to learn content and language is increasing in Sweden primarily at upper secondary schools. This dissertation can be seen as twofold: firstly, a project was conducted in an 8th grade at a compulsory school in the southern part of Sweden that implement interdisciplinary work on a daily basis; secondly, data was gathered from questionnaires and interviews with both teachers and pupils who participated in the project. The results show that this approach is time-consuming and very challenging for pupils in general; it is particularly difficult for weaker pupils in English. Also, it may lead to shortcomings in the Swedish language, with terminology in particular. However, both teachers and pupils think that learning English while studying subject matter is effective, since pupils have the opportunity to immerse themselves in the English language more than otherwise. Working with subject matter in English is very different from doing it in Swedish and there are aspects that must be taken into consideration when planning, designing and implementing this approach at compulsory school level.

The amount of video content online will nearly triple in quantity by 2021 compared to 2016. The implementation of sophisticated filters is of paramount importance to manage this information flow. The research question of this thesis asks to what extent it is possible to generate personal recommendations, based on the data that news videos implies. The objective is to evaluate how different recommender systems compare to complete random, each other and how they are received by users in a test environment. This study was performed during the spring of 2018, and explore four different algorithms. These recommender systems include a content-based, a collaborative-filter, a hybrid model and a popularity model as a baseline. The dataset originates from a news media startup called Newstag, who provide video news on a global scale. The data is sparse and includes implicit feedback only. Three offline experiments and a user test were performed. The metric that guided the algorithms offline performance was their recall at 5 and 10, due to the fact that the top list of recommended items are of most interest. A comparison was done on different amounts of meta-data included during training. Another test explored respective algorithms performance as the density of the data increased. In the user test, a mean opinion score was calculated based on the quality of recommendations that each of the algorithms generated for the test subjects. The user test also included randomly sampled news videos to compare with as a baseline. The results indicate that for this specific setting and data set, the content-based recommender system performed best in both the recall at five and ten, as well as in the user test. All of the algorithms outperformed the random baseline. / Mängden video som finns tillgänglig på internet förväntas att tredubblas år 2021 jämfört med 2016. Detta innebär ett behov av sofistikerade filter för att kunna hantera detta informationsflöde. Detta examensarbete ämnar att svara på till vilken grad det går att generera personliga rekommendationer baserat på det data som nyhetsvideo innebär. Syftet är att utvärdera och jämföra olika rekommendationssystem och hur de står sig i ett användartest. Studien utfördes under våren 2018 och utvärderar fyra olika algoritmer. Dessa olika rekommendationssystem innefattar tekniker som content-based, collaborative-filter, hybrid och en popularitetsmodell används som basvärde. Det dataset som används är glest och har endast implicita attribut. Tre experiment utförs samt ett användartest. Mätpunkten för algoritmernas prestanda utgjordes av recall at 5 och recall at 10, dvs. att man mäter hur väl algoritmerna lyckas generera värdefulla rekommendationer i en topp-fem respektive topp-10-lista av videoklipp. Detta då det är av intresse att ha de mest relevanta videorna högst upp i sin lista av resultat. En jämförelse gjordes mellan olika mängd metadata som inkluderades vid träning. Ett annat test gick ut på att utforska hur algoritmerna presterar då datasetet blir mindre glest. I användartestet användes en utvärderingsmetod kallad mean-opinion-score och denna räknades ut per algoritm genom att testanvändare gav betyg på respektive rekommendation, baserat på hur intressant videon var för dem. Användartestet inkluderade även slumpmässigt generade videos för att kunna jämföras i form av basvärde. Resultaten indikerar, för detta dataset, att algoritmen content-based presterar bäst både med hänsyn till recall at 5 & 10 samt den totala poängen i användartestet. Alla algoritmer presterade bättre än slumpen.