{
    "exported_at": "2026-11-17 00:07:16",
    "count": 29,
    "records": [
        {
            "id": 122,
            "title": "Automatic text classification using bag of words and bag of concepts based representations",
            "title_ar": "",
            "title_en": "Automatic text classification using bag of words and bag of concepts based representations",
            "author": "Alaa Y. Alahmadi",
            "supervisor": "",
            "degree_type": "unspecified",
            "degree_evidence": "",
            "university": "Dublin Institute of Technology",
            "university_source": "repository_host",
            "college": "",
            "department": "",
            "country": "Ireland",
            "governorate": "",
            "publication_year": 2016,
            "language": "en",
            "research_domain": "nlp",
            "research_subdomain": "arabic-nlp",
            "categories": "machine-learning; nlp; data-mining; arabic-nlp",
            "keywords": "",
            "abstract": "Automatic Text Classification (ATC) is one of the most important tasks in data mining for organizing information and knowledge discovery. The goal of ATC is to alleviate the need of manually organizing large collections of text documents, which is done by assigning one or more predefined categories to a given textual document via applying appropriate natural language processing techniques. Overall, the classification process involves three components: text pre-processing, text representation and the classifier which is built using one of the Machine Learning (ML) algorithms. In general, all existing text representations are based on the Bag-of-Words (BOW) and Bag-of-Concepts (BOC) models and their variations. The BOW representation model ignores the semantic connections between words by breaking terms into their constituent words, and synonymous words are considered as independent words with no semantic association. The BOW limitations are addressed by using concepts as features in BOC model to represent text in ATC systems. The aim of this work is to investigate and assess the effect of communally available text representation models on the performance of ATC system, in term of the accuracy of the classification and the efficiency of implementation. To achieve that, both BOW and BOC representation models are used with the ATC system and Wikipedia as a knowledge base is utilized to provide concepts. In addition, different strategies that use both words and concepts to build combined models are reviewed and compared to BOW and BOC representation models. Moreover, two languages are used to evaluate these representation models in their ATC system, which are English and Arabic. For Arabic ATC system, different variations of BOW representation models are compared which is a result of different methods that used in text pre-processing component. Furthermore, WordNet as KBs is used to provide concepts to represent Arabic text in the ATC system. This is then followed by attempts to enrich text representation by combining the features of both BOW and BOC models, in order to further enhance the performance of the ATC. Our investigation has resulted in the development of two new strategies, namely Adding Unmapped Concepts (AUC) and Using Concepts for Terms which do not appear in the Document (CTD). Both developed strategies improve ATC systems’ performance in comparison with BOW and BOC representation models. They also bring text classification to a qualitatively new level of performance when compared to other strategies. In addition, CTD developed strategy reduced the time and memory required compared to other strategies used to enrich text representation in ATC systems. The results of our experiments show that text representation is a key element affecting the performance of both English and Arabic ATC systems, and the developed strategies show improvement in both languages in ATC systems. Furthermore, using Wikipedia concepts to build BOC model for Arabic ATC shows more efficiency for representing text than BOW model which does not line with what has been stated in English ATC. The reason behind that is the complex nature of the Arabic language which contains rich morphology and a large degree of the inflections and derivations. In addition, Arabic suffers from poor a morphological tool which makes Wikipedia concepts better features to represent text.",
            "source_url": "https:\/\/openalex.org\/W2531375441",
            "pdf_url": "",
            "doi": "10.34961\/3639",
            "handle": "",
            "repository_name": "Arrow@dit (Dublin Institute of Technology)",
            "source_record_id": "W2531375441",
            "other_sources": "",
            "verification_status": "needs_review",
            "created_at": "2026-11-15 16:52:47",
            "updated_at": "2026-11-15 16:52:47"
        },
        {
            "id": 150,
            "title": "Design and Evaluation of a Supervised Machine Learning-Based Intrusion Detection System.",
            "title_ar": "",
            "title_en": "Design and Evaluation of a Supervised Machine Learning-Based Intrusion Detection System.",
            "author": "Tarquin Qazi",
            "supervisor": "",
            "degree_type": "unspecified",
            "degree_evidence": "",
            "university": "",
            "university_source": "",
            "college": "",
            "department": "",
            "country": "",
            "governorate": "",
            "publication_year": 2026,
            "language": "en",
            "research_domain": "machine-learning",
            "research_subdomain": "data-mining",
            "categories": "machine-learning; ai-applications; data-mining; predictive-analytics; ai-education; ai-cybersecurity; ai-industry",
            "keywords": "",
            "abstract": "This project involves designing and evaluating a supervised machine-learning-based intrusion detection system (IDS) using the CIC-IDS2017 dataset.The project is structured around the cross-industry standard process for data mining (CRISP-DM) framework.The dataset comprises over 2.8 million labelled instances and was cleaned and reduced from 78 to 63 features via redundancy analysis.These data were used to train and tune three supervised classifiers: Logistic Regression algorithm as a linear baseline, a Decision Tree algorithm and a Random Forest algorithm.Hyperparameter optimisation was conducted using RandomizedSearchCV with 3-fold cross-validation, optimising for the F1-macro scoring metric.While the random forest performed similarly on majority classes, the final decision tree model generalised significantly better on rare attacks such as Heartbleed and Infiltration.On the test set, the decision tree achieved a macro-F1 score of 0.96 and an accuracy score of 99.88%, with a minimal train\/test gap of 0.0008.To evaluate its real-world viability, the model was deployed via a live capture test using Nmap, Wireshark and CICFlowMeter, alongside a cross-dataset evaluation on CIC-IDS2018.The final results highlighted the inherent challenges of cross-dataset generalisation: while the model maintained high precision, it exhibited reduced recall on unseen data.",
            "source_url": "https:\/\/openalex.org\/W7214345887",
            "pdf_url": "https:\/\/arc.cct.ie\/cgi\/viewcontent.cgi?article=1163&context=ict",
            "doi": "10.63227\/652.299.144",
            "handle": "",
            "repository_name": "",
            "source_record_id": "W7214345887",
            "other_sources": "",
            "verification_status": "needs_review",
            "created_at": "2026-11-15 16:52:47",
            "updated_at": "2026-11-15 16:52:47"
        },
        {
            "id": 172,
            "title": "Quantum Machine Learning",
            "title_ar": "",
            "title_en": "Quantum Machine Learning",
            "author": "Cristian Romero García",
            "supervisor": "",
            "degree_type": "unspecified",
            "degree_evidence": "",
            "university": "Universidad del Pais Vasco",
            "university_source": "repository_host",
            "college": "",
            "department": "",
            "country": "Spain",
            "governorate": "",
            "publication_year": 2016,
            "language": "en",
            "research_domain": "machine-learning",
            "research_subdomain": "quantum-ml",
            "categories": "machine-learning; quantum-ml; data-mining; predictive-analytics",
            "keywords": "",
            "abstract": "[EN] In a world in which accessible information grows exponentially, the selection of the appropriate information turns out to be an extremely relevant problem. In this context, the idea of Machine Learning (ML), a subfield of Artificial Intelligence, emerged to face problems in data mining, pattern recognition, automatic prediction, among others. Quantum Machine Learning is an interdisciplinary research area combining quantum mechanics with methods of ML, in which quantum properties allow for an exponential speed-up in the algorithms. This field is currently one of the main research areas in companies like Google and Microsoft, due to the revolution that they could provide in data management.",
            "source_url": "https:\/\/openalex.org\/W7061493127",
            "pdf_url": "",
            "doi": "",
            "handle": "",
            "repository_name": "Communities in ADDI (Universidad del Pais Vasco)",
            "source_record_id": "W7061493127",
            "other_sources": "",
            "verification_status": "needs_review",
            "created_at": "2026-11-15 16:52:47",
            "updated_at": "2026-11-15 16:52:47"
        },
        {
            "id": 175,
            "title": "Quantum machine learning for supervised pattern recognition.",
            "title_ar": "",
            "title_en": "Quantum machine learning for supervised pattern recognition.",
            "author": "Maria Schuld",
            "supervisor": "",
            "degree_type": "unspecified",
            "degree_evidence": "",
            "university": "University of KwaZulu-Natal",
            "university_source": "repository_host",
            "college": "",
            "department": "",
            "country": "South Africa",
            "governorate": "",
            "publication_year": 2017,
            "language": "en",
            "research_domain": "computer-vision",
            "research_subdomain": "quantum-ml",
            "categories": "machine-learning; deep-learning; computer-vision; quantum-ml; data-mining; predictive-analytics",
            "keywords": "",
            "abstract": "Humans are experts at recognising patterns in past experience and applying them to new tasks. For example, after seeing pictures of a face we can usually tell if another image contains the same person or not. Machine learning is a research discipline at the intersection of computer science, statistics and mathematics that investigates how pattern recognition can be performed by machines and for large amounts of data. Since a few years machine learning has come into the focus of quantum computing in which information processing based on the laws of quantum theory is explored. Although large scale quantum computers are still in the first stages of development, their theoretical description is well-understood and can be used to formulate `quantum software' or `quantum algorithms' for pattern recognition. Researchers can therefore analyse the impact quantum computers may have on intelligent data mining. This approach is part of the emerging research discipline of quantum machine learning that harvests synergies between quantum computing and machine learning. The research objective of this thesis is to understand how we can solve a slightly more specific problem called supervised pattern recognition based on the language that has been developed for universal quantum computers. The contribution it makes is twofold: First, it presents a methodology that understands quantum machine learning as the combination of data encoding into quantum systems and quantum optimisation. Second, it proposes several quantum algorithms for supervised pattern recognition. These include algorithms for convex and non-convex optimisation, implementations of distance-based methods through quantum interference, and the preparation of quantum states from which solutions can be derived via sampling. Amongst the machine learning methods considered are least-squares linear regression, gradient descent and Newton's method, k-nearest neighbour, neural networks as well as ensemble methods. Together with the growing body of literature, this thesis demonstrates that quantum computing offers a number of interesting tools for machine learning applications, and has the potential to create new models of how to learn from data.",
            "source_url": "https:\/\/openalex.org\/W2898293445",
            "pdf_url": "",
            "doi": "",
            "handle": "",
            "repository_name": "ResearchSpace (University of KwaZulu-Natal)",
            "source_record_id": "W2898293445",
            "other_sources": "",
            "verification_status": "needs_review",
            "created_at": "2026-11-15 16:52:47",
            "updated_at": "2026-11-15 16:52:47"
        },
        {
            "id": 334,
            "title": "Predictive Scheduling of Incoming Goods Using Machine Learning and Deep Learning Methods",
            "title_ar": "",
            "title_en": "",
            "author": "Johannes Simon Michael Rechenauer",
            "supervisor": "",
            "degree_type": "unspecified",
            "degree_evidence": "",
            "university": "TU Wien",
            "university_source": "repository_host",
            "college": "",
            "department": "",
            "country": "Austria",
            "governorate": "",
            "publication_year": 2026,
            "language": "de",
            "research_domain": "deep-learning",
            "research_subdomain": "data-mining",
            "categories": "machine-learning; deep-learning; ai-applications; data-mining; predictive-analytics; ai-education",
            "keywords": "",
            "abstract": "Die vorliegende Arbeit untersucht den Einsatz von Machine-Learning- und Deep-Learning-Verfahren zur prädiktiven Terminierung von Wareneingängen. Ausgangspunkt bilden betriebliche Herausforderungen, welche durch Lieferabweichungen entstehen und eine zuverlässige Materialversorgung erschweren. Die zentrale Zielsetzung besteht somit darin, Wareneingänge mithilfe datengetriebener Prognosemodelle so zu terminieren, dass Materialbedarfe gedeckt und gleichzeitig Lagerbestände möglichst gering gehalten werden. Methodisch orientiert sich diese Arbeit am CRISP-DM-Prozess, welcher als Rahmen dient, um die betriebliche Problemstellung systematisch in ein Data-Mining-Problem zu überführen. Dafür wird die Problemstellung zunächst konzeptionell in einem Unternehmen verortet. Gleichzeitig werden Grundlagen in den Bereichen logistische Planung, Data Mining, Deep Learning und Machine Learning gelegt. Darauf aufbauend wird ein Data-Mining-Projekt in einem realen Unternehmensumfeld ausgearbeitet. Dabei wird die Wareneingangsterminierung als betriebliche Problemstellung eingeordnet und als Klassifikationsproblem formuliert. Im Rahmen der Modellierungsphase werden daraufhin verschiedene Boosting-Modelle und Deep-Learning-Ansätze verglichen. Der Fokus liegt in diesem Zusammenhang nicht auf der isolierten Leistung einzelner Algorithmen, sondern auf der Leistungsfähigkeit der gesamten Modell-Pipeline. Diese umfasst die modellspezifische Datenvorverarbeitung, das Modelltraining, die Hyperparameter-Optimierung sowie die anschließende Evaluation. Dadurch werden die Verfahren unter möglichst praxisnahen Bedingungen hinsichtlich ihrer Vorhersageleistung und praktischen Anwendbarkeit miteinander verglichen. Die Ergebnisse zeigen, dass Boosting-Verfahren im untersuchten Anwendungsfall am besten abschneiden. Insbesondere die auf LightGBM basierende Pipeline erzielt die beste Kombination aus Vorhersageleistung und Effizienz, während die getesteten Deep-Learning-Modelle trotz längerer Trainingszeiten schwächere Ergebnisse liefern. Aufbauend auf den Ergebnissen des Modellvergleichs wird dargestellt, wie prognostizierte Verzögerungsklassen in konkrete Vorschläge zur Wareneingangsterminierung überführt und im Rahmen des CRISP-DM-Prozesses in einem Unternehmen implementiert werden können. Somit leistet die Arbeit einerseits einen Beitrag zur praxisnahen Ausarbeitung eines Data-Mining-Projekts und verdeutlicht andererseits, dass moderne Boosting-Verfahren insbesondere bei kleinen tabellarischen Datensätzen Deep-Learning-Architekturen überlegen sein können.",
            "source_url": "https:\/\/openalex.org\/W7223559876",
            "pdf_url": "https:\/\/repositum.tuwien.at\/bitstream\/20.500.12708\/230957\/1\/Rechenauer%20Johannes%20Simon%20Michael%20-%202026%20-%20Praediktive%20Terminierung%20von...pdf",
            "doi": "10.34726\/hss.2026.144705",
            "handle": "",
            "repository_name": "reposiTUm (TU Wien)",
            "source_record_id": "W7223559876",
            "other_sources": "",
            "verification_status": "needs_review",
            "created_at": "2026-11-15 16:52:48",
            "updated_at": "2026-11-15 16:52:48"
        },
        {
            "id": 516,
            "title": "Graph neural networks for improvement recommender system",
            "title_ar": "",
            "title_en": "Graph neural networks for improvement recommender system",
            "author": "Tran, Trung Tin",
            "supervisor": "",
            "degree_type": "unspecified",
            "degree_evidence": "",
            "university": "",
            "university_source": "",
            "college": "",
            "department": "",
            "country": "Czech Republic",
            "governorate": "",
            "publication_year": 2024,
            "language": "en",
            "research_domain": "deep-learning",
            "research_subdomain": "gnn",
            "categories": "machine-learning; deep-learning; data-mining; gnn",
            "keywords": "",
            "abstract": "The field of recommender systems is a significant branch of data mining, with extensive applications in both research and practical contexts. These systems leverage user and item interaction data to generate personalized item recommendations, enhancing user experiences in e-commerce by promoting items that align with user preferences. Beyond e-commerce, recommender systems are also applied in recommending books, movies, courses, and websites. User recommendations are primarily determined by the similarity between users, assessed using techniques such as collaborative filtering (CF), matrix factorization (MF), and singular value decomposition (SVD). These techniques typically rely on matrices of past user ratings. In graph data mining, interactions between users and items can be represented as a graph, enabling more extensive and effective interaction filtering techniques. Graph Neural Network (GNN) models are crucial for representing and extracting insights from graph data. Social relationships significantly influence shopping habits, with recommendations from friends often having a greater impact than those from other sources. Integrating social connections with user similarity, based on shared shopping patterns, presents challenges due to the noise and variability in different datasets. This complexity is further amplified when considering relationships between items, such as geographic location, product type, buyer comments, and visit time sessions. Summarized, the integration of advanced techniques such as GNNs and the consideration of social connections and item relations offer promising advancements in the effectiveness of recommender systems, despite the inherent challenges.",
            "source_url": "https:\/\/openalex.org\/W7111980195",
            "pdf_url": "https:\/\/dspace.vsb.cz\/bitstreams\/53bf97bd-4960-4c1a-9be0-3367945bfc2b\/download",
            "doi": "",
            "handle": "",
            "repository_name": "DSpace VŠB-TUO (VŠB-TUO)",
            "source_record_id": "W7111980195",
            "other_sources": "",
            "verification_status": "needs_review",
            "created_at": "2026-11-15 16:52:50",
            "updated_at": "2026-11-15 16:52:50"
        },
        {
            "id": 867,
            "title": "Temporal models for mining, ranking and recommendation in the Web",
            "title_ar": "",
            "title_en": "Temporal models for mining, ranking and recommendation in the Web",
            "author": "Nguyen Hoang Tu",
            "supervisor": "",
            "degree_type": "unspecified",
            "degree_evidence": "",
            "university": "Leibniz Universität Hannover",
            "university_source": "repository_host",
            "college": "",
            "department": "",
            "country": "Germany",
            "governorate": "",
            "publication_year": 2020,
            "language": "en",
            "research_domain": "nlp",
            "research_subdomain": "data-mining",
            "categories": "machine-learning; deep-learning; computer-vision; nlp; medical-ai; data-mining; predictive-analytics",
            "keywords": "",
            "abstract": "Due to their first-hand, diverse and evolution-aware reflection of nearly all areas of life, heterogeneous temporal datasets i.e., the Web, collaborative knowledge bases and social networks have been emerged as gold-mines for content analytics of many sorts. In those collections, time plays an essential role in many crucial information retrieval and data mining tasks, such as from user intent understanding, document ranking to advanced recommendations. There are two semantically closed and important constituents when modeling along the time dimension, i.e., entity and event. Time is crucially served as the context for changes driven by happenings and phenomena (events) that related to people, organizations or places (so-called entities) in our social lives. Thus, determining what users expect, or in other words, resolving the uncertainty confounded by temporal changes is a compelling task to support consistent user satisfaction. In this thesis, we address the aforementioned issues and propose temporal models that capture the temporal dynamics of such entities and events to serve for the end tasks. Specifically, we make the following contributions in this thesis: (1) Query recommendation and document ranking in the Web - we address the issues for suggesting entity-centric queries and ranking effectiveness surrounding the happening time period of an associated event. In particular, we propose a multi-criteria optimization framework that facilitates the combination of multiple temporal models to smooth out the abrupt changes when transitioning between event phases for the former and a probabilistic approach for search result diversification of temporally ambiguous queries for the latter. (2) Entity relatedness in Wikipedia - we study the long-term dynamics of Wikipedia as a global memory place for high-impact events, specifically the reviving memories of past events. Additionally, we propose a neural network-based approach to measure the temporal relatedness of entities and events. The model engages different latent representations of an entity (i.e., from time, link-based graph and content) and use the collective attention from user navigation as the supervision. (3) Graph-based ranking and temporal anchor-text mining inWeb Archives - we tackle the problem of discovering important documents along the time-span ofWeb Archives, leveraging the link graph. Specifically, we combine the problems of relevance, temporal authority, diversity and time in a unified framework. The model accounts for the incomplete link structure and natural time lagging in Web Archives in mining the temporal authority. (4) Methods for enhancing predictive models at early-stage in social media and clinical domain - we investigate several methods to control model instability and enrich contexts of predictive models at the “cold-start” period. We demonstrate their effectiveness for the rumor detection and blood glucose prediction cases respectively. Overall, the findings presented in this thesis demonstrate the importance of tracking these temporal dynamics surround salient events and entities for IR applications. We show that determining such changes in time-based patterns and trends in prevalent temporal collections can better satisfy user expectations, and boost ranking and recommendation effectiveness over time.",
            "source_url": "https:\/\/openalex.org\/W3014066870",
            "pdf_url": "https:\/\/repo.uni-hannover.de\/bitstreams\/edcbab5a-c159-4955-b94f-809b5250aea7\/download",
            "doi": "10.15488\/9750",
            "handle": "",
            "repository_name": "Institutional Repository of Leibniz Universität Hannover (Leibniz Universität Hannover)",
            "source_record_id": "W3014066870",
            "other_sources": "",
            "verification_status": "needs_review",
            "created_at": "2026-11-15 16:52:53",
            "updated_at": "2026-11-15 16:52:53"
        },
        {
            "id": 1138,
            "title": "Classification using data mining algorithms and fuzzy logic on neutron star signal data",
            "title_ar": "",
            "title_en": "",
            "author": "Ιωάννης Μανώλης",
            "supervisor": "",
            "degree_type": "unspecified",
            "degree_evidence": "",
            "university": "University of Piraeus",
            "university_source": "repository_host",
            "college": "",
            "department": "",
            "country": "Greece",
            "governorate": "",
            "publication_year": 2025,
            "language": "el",
            "research_domain": "machine-learning",
            "research_subdomain": "data-mining",
            "categories": "machine-learning; expert-systems; data-mining",
            "keywords": "",
            "abstract": "Η παρούσα μελέτη διερευνά την απόδοση τόσο κλασικών όσο και ασαφών αλγορίθμων ταξινόμησης στην πρόβλεψη της αυθεντικότητας σημάτων pulsar, χρησιμοποιώντας ένα ευρέως αποδεκτό σύνολο χαρακτηριστικών που έχει προταθεί ως πρότυπη αναφορά για τις μελλοντικές έρευνες ανίχνευσης. Εκπαιδεύτηκαν και αξιολογήθηκαν έξι μοντέλα μηχανικής μάθησης, συμπεριλαμβανομένων τεσσάρων κλασικών αλγορίθμων ταξινόμησης (Λογιστική Παλινδρόμηση, Random Forest, SVM και XGBoost), καθώς και δύο προσαρμοσμένων ταξινομητών ασαφούς λογικής (Fuzzy k-NN και Fuzzy Decision Tree). Τα ασαφή μοντέλα ενσωματώνουν μηχανισμούς ταξινομικής ασαφοποίησης και διαδικασίες εξαγωγής κανόνων για τη βελτίωση της ερμηνευσιμότητας. Τα αποτελέσματα έδειξαν ότι τα κλασικά μοντέλα επιτυγχάνουν υψηλή ακρίβεια και ανθεκτικότητα, με τα Random Forest και SVM να παρουσιάζουν ιδιαίτερα υψηλές αποδόσεις. Ωστόσο, οι ασαφείς προσεγγίσεις προσφέρουν σημαντικά πλεονεκτήματα στη διαφάνεια των αποφάσεων, που τις καθιστούν χρήσιμες σε πεδία όπου η ερμηνευσιμότητα είναι κρίσιμη. Η μελέτη επιβεβαιώνει επίσης την καταλληλότητα των επιλεγμένων χαρακτηριστικών για την αξιόπιστη ανίχνευση σημάτων pulsar και προτείνει κατευθύνσεις για μελλοντική έρευνα ώστε να αξιολογηθεί περαιτέρω η επάρκειά τους. Η έρευνα υλοποιήθηκε χρησιμοποιώντας τις κατάλληλες βιβλιοθήκες της γλώσσας προγραμματισμού Python.",
            "source_url": "https:\/\/openalex.org\/W7152335526",
            "pdf_url": "",
            "doi": "",
            "handle": "",
            "repository_name": "Dione (University of Piraeus)",
            "source_record_id": "W7152335526",
            "other_sources": "",
            "verification_status": "needs_review",
            "created_at": "2026-11-15 16:52:58",
            "updated_at": "2026-11-15 16:52:58"
        },
        {
            "id": 1139,
            "title": "Intelligent data mining using artificial neural networks and genetic algorithms : techniques and applications",
            "title_ar": "",
            "title_en": "Intelligent data mining using artificial neural networks and genetic algorithms : techniques and applications",
            "author": "Jianhua Yang",
            "supervisor": "",
            "degree_type": "unspecified",
            "degree_evidence": "",
            "university": "University of Warwick",
            "university_source": "repository_host",
            "college": "",
            "department": "",
            "country": "United Kingdom",
            "governorate": "",
            "publication_year": 2026,
            "language": "en",
            "research_domain": "medical-ai",
            "research_subdomain": "xai",
            "categories": "machine-learning; deep-learning; medical-ai; responsible-ai; expert-systems; data-mining; predictive-analytics; optimization; xai",
            "keywords": "",
            "abstract": "Data Mining (DM) refers to the analysis of observational datasets to find relationships and to summarize the data in ways that are both understandable and useful. Many DM techniques exist. Compared with other DM techniques, Intelligent Systems (ISs) based approaches, which include Artificial Neural Networks (ANNs), fuzzy set theory, approximate reasoning, and derivative-free optimization methods such as Genetic Algorithms (GAs), are tolerant of imprecision, uncertainty, partial truth, and approximation. They provide flexible information processing capability for handling real-life situations. This thesis is concerned with the ideas behind design, implementation, testing and application of a novel ISs based DM technique. The unique contribution of this thesis is in the implementation of a hybrid IS DM technique (Genetic Neural Mathematical Method, GNMM) for solving novel practical problems, the detailed description of this technique, and the illustrations of several applications solved by this novel technique. GNMM consists of three steps: (1) GA-based input variable selection, (2) Multi- Layer Perceptron (MLP) modelling, and (3) mathematical programming based rule extraction. In the first step, GAs are used to evolve an optimal set of MLP inputs. An adaptive method based on the average fitness of successive generations is used to adjust the mutation rate, and hence the exploration\/exploitation balance. In addition, GNMM uses the elite group and appearance percentage to minimize the randomness associated with GAs. In the second step, MLP modelling serves as the core DM engine in performing classification\/prediction tasks. An Independent Component Analysis (ICA) based weight initialization algorithm is used to determine optimal weights before the commencement of training algorithms. The Levenberg-Marquardt (LM) algorithm is used to achieve a second-order speedup compared to conventional Back-Propagation (BP) training. In the third step, mathematical programming based rule extraction is not only used to identify the premises of multivariate polynomial rules, but also to explore features from the extracted rules based on data samples associated with each rule. Therefore, the methodology can provide regression rules and features not only in the polyhedrons with data instances, but also in the polyhedrons without data instances. A total of six datasets from environmental and medical disciplines were used as case study applications. These datasets involve the prediction of longitudinal dispersion coefficient, classification of electrocorticography (ECoG)\/Electroencephalogram (EEG) data, eye bacteria Multisensor Data Fusion (MDF), and diabetes classification (denoted by Data I through to Data VI). GNMM was applied to all these six datasets to explore its effectiveness, but the emphasis is different for different datasets. For example, the emphasis of Data I and II was to give a detailed illustration of how GNMM works; Data III and IV aimed to show how to deal with difficult classification problems; the aim of Data V was to illustrate the averaging effect of GNMM; and finally Data VI was concerned with the GA parameter selection and benchmarking GNMM with other IS DM techniques such as Adaptive Neuro-Fuzzy Inference System (ANFIS), Evolving Fuzzy Neural Network (EFuNN), Fuzzy ARTMAP, and Cartesian Genetic Programming (CGP). In addition, datasets obtained from published works (i.e. Data II & III) or public domains (i.e. Data VI) where previous results were present in the literature were also used to benchmark GNMM’s effectiveness. As a closely integrated system GNMM has the merit that it needs little human interaction. With some predefined parameters, such as GA’s crossover probability and the shape of ANNs’ activation functions, GNMM is able to process raw data until some human-interpretable rules being extracted. This is an important feature in terms of practice as quite often users of a DM system have little or no need to fully understand the internal components of such a system. Through case study applications, it has been shown that the GA-based variable selection stage is capable of: filtering out irrelevant and noisy variables, improving the accuracy of the model; making the ANN structure less complex and easier to understand; and reducing the computational complexity and memory requirements. Furthermore, rule extraction ensures that the MLP training results are easily understandable and transferrable.",
            "source_url": "https:\/\/openalex.org\/W2111157768",
            "pdf_url": "http:\/\/wrap.warwick.ac.uk\/3831\/1\/WRAP_THESIS_Yang_2010.pdf",
            "doi": "10.82444\/warw.33491953",
            "handle": "",
            "repository_name": "Warwick Research Archive Portal (University of Warwick)",
            "source_record_id": "W2111157768",
            "other_sources": "",
            "verification_status": "needs_review",
            "created_at": "2026-11-15 16:52:58",
            "updated_at": "2026-11-15 16:52:58"
        },
        {
            "id": 1140,
            "title": "The development of new artificial intelligence based hybrid techniques combining bees algorithm, data mining and genetic algorithm for detection, classification and prediction of faults in induction motors",
            "title_ar": "",
            "title_en": "The development of new artificial intelligence based hybrid techniques combining bees algorithm, data mining and genetic algorithm for detection, classification and prediction of faults in induction motors",
            "author": "Ammar K. Al-Musawi",
            "supervisor": "",
            "degree_type": "unspecified",
            "degree_evidence": "",
            "university": "Cardiff University",
            "university_source": "repository_host",
            "college": "",
            "department": "",
            "country": "United Kingdom",
            "governorate": "",
            "publication_year": 2019,
            "language": "en",
            "research_domain": "computer-vision",
            "research_subdomain": "data-mining",
            "categories": "machine-learning; computer-vision; ai-applications; data-mining; predictive-analytics; optimization; ai-industry",
            "keywords": "",
            "abstract": "This thesis focuses on applying Artificial Intelligence (AI) methods for detecting, classifying and predicting the faults in induction motors in order to prevent any failures happening during their operation due to loading conditions. It is very important to monitor and detect any faults in the motor during its operation in order to alert the operators so that potential problems could be avoided. In this study, a new AI algorithm has been developed and applied to detect, classify and predict the induction motor faults at an early stage. This is based on a hybrid approach using the Bees Algorithm (BA) and Data Mining called Bee for Mining (B4M), which overcomes the drawbacks of current AI methods in achieving higher classification accuracy with reduced rule set generated from the training data. The proposed B4M algorithm has been implemented, tested and validated using the University of California at Irvine (UCI) dataset, and was compared with other well-known classifiers. Later, the proposed B4M algorithm was applied in dealing with two most common faults, firstly, that of rotor (one rotor bar, four rotor bars and eight rotor bars), and secondly, bearing defects (inner race, outer race and ball bearing defects). In this research, three condition monitoring techniques involving thermal imaging, current and vibration signal processing have been used to monitor these faults. Further, features such as image metrics and Discrete Wavelet Transform (DWT) coefficients were extracted from the thermal images, and DWT coefficients from the current and vibration signals. Later, five-feature selection methods were applied in order to select the best features for defect classification. Finally, an improvement to the proposed B4M was made by producing a new hybrid classification algorithm by combining The Development of New Artificial Intelligence based Hybrid Techniques Combining Bees Algorithm, Data Mining and Genetic Algorithm for Detection, Classification and Prediction of Faults in Induction Motors Page | v Genetic Algorithm (GA) with B4M referred to as GA-B4M where the GA was used for feature selection. The new algorithms were successfully implemented on MATLAB and its performance was tested on real data and compared with other algorithms using the WEKA software. The results obtained for the thermal image monitoring data showed 98.97% classification accuracy with a reduced rule set containing 10 rules for B4M while a 100% accuracy with a larger rule set of 63 and 72 rules were achieved by Decision Table and OneR classifiers respectively. For the current monitoring data, the classification accuracy fell to 79.62% with only 8 rules for B4M, while 79.20% with 837 rules was achieved by Random Tree. Similarly, for the vibration monitoring data the B4M achieved 80.05% with 7 rules in comparison with Naïve Bayes tree at 79.25% with 31 rules. Furthermore, the results achieved by the proposed hybrid approach GAB4M on thermal imaging dataset also showed an overall improvement on the classification accuracy reaching 99.85% with 7 rules. Similarly, on the current and vibration dataset the GA-B4M obtained 79.98% with 16 rules and 98.74% with 7 rules respectively. This study has shown that the new proposed classification algorithms B4M and GA-B4M are able to detect, classify and predict the induction motor faults more reliably.",
            "source_url": "https:\/\/openalex.org\/W2982461209",
            "pdf_url": "",
            "doi": "",
            "handle": "",
            "repository_name": "ORCA Online Research @Cardiff (Cardiff University)",
            "source_record_id": "W2982461209",
            "other_sources": "",
            "verification_status": "needs_review",
            "created_at": "2026-11-15 16:52:58",
            "updated_at": "2026-11-15 16:52:58"
        },
        {
            "id": 1141,
            "title": "Data mining of classification for sybil user detection",
            "title_ar": "",
            "title_en": "Data mining of classification for sybil user detection",
            "author": "Anand Chinchore",
            "supervisor": "",
            "degree_type": "unspecified",
            "degree_evidence": "",
            "university": "University of Technology Sydney",
            "university_source": "repository_host",
            "college": "",
            "department": "",
            "country": "Australia",
            "governorate": "",
            "publication_year": 2016,
            "language": "en",
            "research_domain": "machine-learning",
            "research_subdomain": "data-mining",
            "categories": "machine-learning; ai-applications; data-mining; predictive-analytics; ai-cybersecurity",
            "keywords": "",
            "abstract": "Data analytics and Big Data application research, along with new structures in complex data, are reveling the secrets of their own complexity and patterns with valuable and critical, but challenging, issues through newly designed tools, techniques and models in data science technology. A common example concerns the interconnectivity of social network users on mobiles, involving content and information sharing through mobile social networks. There have been a large number of studies on mobile networks. Many focus on a variety of secured applications that attempt to exploit social connections, impersonate users or attack social groups. Such applications are often created with the intention of collecting confidential information, laundering money, blackmail or to perform other criminal activities. Existing methods for identifying such activity, such as distributed systems, social graph-based sybil detection, behaviour classification, and local ranking systems that estimate the trust level between users, rely on the dependencies between random nodes of connection on mobile social networks. These models aim to detect suspicious connections and have the advantage of learning the relationships between nodes and data. However, their detection patterns tend to impose the behavioural patterns typically associated with community-based and external networks. In data mining, the graph-based and classification models used for pattern collection can accurately predict patterns in data in targeted categories. Decision trees, commonly used for classification, are trees in which each branch represents a choice between a number of alternatives, and each leaf represents a classification, or decision. For example, a decision tree may help an institution decide whether a node in a dataset is suspicious, or considered to be sybil, if a decision tree can be induced from a set of data about its instances and the - classifications of those instances. It could also provide the flexibility to demonstrate data distribution. Thus, researchers have tried to combine different techniques and methods into network-based models to detect various patterns generated by sybil nodes within a network. The purpose of this thesis is to abridge existing classification and regression techniques to identify sybil nodes, and the correlation of those nodes with time, to address these research limitations. Classification and regression techniques predict behaviour based on continuous or categorical responses. For example if the predicted response is continuous, then it is called a regression tree. If the response is categorical, it is called a classification tree. At each node of the tree, the value of one the connected input nodes is checked and a binary answer – yes or no – determines whether one continues to the left or right sub-branch. When a leaf is reached, a prediction follows from a series of entropy calculations and graphing techniques. This thesis introduces a novel classification model for sybil detection in mobile social behaviour that identifies dependencies using connection duration and other attributes. Roger Quinlan’s C4.5 algorithm, its resulting decision tree and a random forest simplify the step-by-step identification process, while maintaining its merits. Partial correlations between nodes are simplified using Rattle programming, and the dataset is divided into majority nodes to assist processing. This research also includes a behavioural survey of the nodes and an extended analysis using a classification system for sybil detection, with a particular focus on sybil attacks in mobile social network environments. Each sybil node is tracked and identified based on the frequency and duration of its connections with other nodes. An outline of how the classified model identifies behaviour is also included, along with an explanation of the flow of the decision tree and the C4.5 algorithm process, which press-gangs identified sybil nodes based on the results of entropy calculations and information gain. The calculated entropy for each node connection across the all datasets informs the information gain. The maxGain calculations for individual node bring the final stage of draw decision tree and helped to predict the sybil nodes, compare and justify the sybil attackers. These processes and new models applied to sybil detection provide insight into the behaviour of connections, through deep analytics and entropy gain. The evidence gleaned from this research brings significant knowledge to data analytics and data science in the identification of threats on mobile social networks.",
            "source_url": "https:\/\/openalex.org\/W2604611620",
            "pdf_url": "",
            "doi": "",
            "handle": "",
            "repository_name": "UTS ePRESS (University of Technology Sydney)",
            "source_record_id": "W2604611620",
            "other_sources": "",
            "verification_status": "needs_review",
            "created_at": "2026-11-15 16:52:58",
            "updated_at": "2026-11-15 16:52:58"
        },
        {
            "id": 1142,
            "title": "Prediction system for Cardio-vascular diseases using data mining algorithms.",
            "title_ar": "",
            "title_en": "Prediction system for Cardio-vascular diseases using data mining algorithms.",
            "author": "Tinotenda Mavetera",
            "supervisor": "",
            "degree_type": "unspecified",
            "degree_evidence": "",
            "university": "North-west University",
            "university_source": "repository_host",
            "college": "",
            "department": "",
            "country": "South Africa",
            "governorate": "",
            "publication_year": 2024,
            "language": "en",
            "research_domain": "medical-ai",
            "research_subdomain": "data-mining",
            "categories": "machine-learning; deep-learning; medical-ai; data-mining; predictive-analytics",
            "keywords": "",
            "abstract": "Background: Cardiovascular disease (CVD) is a major global health concern, accounting for a significant proportion of morbidity and mortality worldwide. Early detection and prevention of CVD reduces the burden of this disease, and data mining techniques show great potential in predicting CVD risk. Data mining algorithms use large datasets to identify patterns and relationships that may not be immediately apparent, making them specifically suitable for analysing complex biomedical data. Objective: This research is designed to determine the best performing machine learning algorithm based on the dataset and demonstrate how this algorithm could be used to predict cardiovascular disease and improve both diagnosis and treatment. The Study examined various data mining techniques and their performance in predicting CVD risk and explore the potential of combining different algorithms for improved prediction accuracy. Methodology: In this research, Knowledge Discovery in Database with iterative and interactive techniques was used to identify patterns from the dataset. The dataset used in this research was obtained from UCI Machine Learning Repository. Results: The results of this study demonstrate that three out of the four implemented algorithms exhibited excellent performance, yielding high classification accuracy for predicting cardiovascular disease. Specifically, Naïve Bayes achieved 85.25%, Decision Tree achieved 71.43%, while the Artificial Neural Network outperformed the other algorithms with a classification accuracy of 91.75%. A classification accuracy of 67% achieved by KNN cannot be said to be excellent. These findings suggest that the top three algorithms could be utilized effectively for predicting the presence of cardiovascular disease. Conclusion: To conclude, this research demonstrates that machine learning could be applied to healthcare and assist medical practitioners to diagnose the presence of cardiovascular disease effectively and thus contribute to the development of efficient CVD prevention strategies that improve public health outcomes.",
            "source_url": "https:\/\/openalex.org\/W7225216488",
            "pdf_url": "https:\/\/repository.nwu.ac.za\/bitstreams\/d117cde3-cd54-4fd4-b347-469073b0c890\/download",
            "doi": "",
            "handle": "",
            "repository_name": "Boloka Institutional Repository (North-west University)",
            "source_record_id": "W7225216488",
            "other_sources": "",
            "verification_status": "needs_review",
            "created_at": "2026-11-15 16:52:58",
            "updated_at": "2026-11-15 16:52:58"
        },
        {
            "id": 1143,
            "title": "Novel Algorithms and Applications for Data Mining and Machine Learning",
            "title_ar": "",
            "title_en": "Novel Algorithms and Applications for Data Mining and Machine Learning",
            "author": "Sudipta Pathak",
            "supervisor": "",
            "degree_type": "unspecified",
            "degree_evidence": "",
            "university": "University of Connecticut",
            "university_source": "repository_host",
            "college": "",
            "department": "",
            "country": "United States",
            "governorate": "",
            "publication_year": 2020,
            "language": "en",
            "research_domain": "medical-ai",
            "research_subdomain": "data-mining",
            "categories": "machine-learning; medical-ai; data-mining; predictive-analytics",
            "keywords": "",
            "abstract": "In this dissertation we propose novel approaches for data mining and machine learn- ing for some of the fundamental and advanced problems in the areas of data analysis and bioinformatics. A number of problems such as Drug-Target Interaction (DTI) pre- diction, Singular Value Decomposition (SVD), Time series Analysis (TSA) and motif search has been studied in this thesis. We have developed algorithms that outperformed the state of art in all of the above mentioned areas. We proposed algorithms for DTI prediction that outperformed all prior algorithms over benchmark datasets under mul- tiple scenarios. Our proposed approaches for Jacobi based SVD, both sequential and parallel, improves the computation time and work compared to the state of art. We also proposed ensemble based TSA models that improves classification accuracy sta- tistically significantly compared to all prior algorithm on benchmark dataset. We also introduced novel motif search algorithms for DNA and protein motifs.",
            "source_url": "https:\/\/openalex.org\/W3083694962",
            "pdf_url": "",
            "doi": "",
            "handle": "",
            "repository_name": "OpenCommons at University of Connecticut (University of Connecticut)",
            "source_record_id": "W3083694962",
            "other_sources": "",
            "verification_status": "needs_review",
            "created_at": "2026-11-15 16:52:58",
            "updated_at": "2026-11-15 16:52:58"
        },
        {
            "id": 1144,
            "title": "Deep Learning for text data mining: Solving spreadsheet data classification.",
            "title_ar": "",
            "title_en": "Deep Learning for text data mining: Solving spreadsheet data classification.",
            "author": "Aleksandr Kimashev",
            "supervisor": "",
            "degree_type": "unspecified",
            "degree_evidence": "",
            "university": "",
            "university_source": "",
            "college": "",
            "department": "",
            "country": "Norway",
            "governorate": "",
            "publication_year": 2017,
            "language": "en",
            "research_domain": "nlp",
            "research_subdomain": "cnn",
            "categories": "machine-learning; deep-learning; nlp; data-mining; cnn; rnn",
            "keywords": "",
            "abstract": "This project developed for the Avito LOOPS company. Research goals was to investigate existing algorithms and implementations of Deep Learning, to understand their applicability to text mining, to design a solution that incorporates theoretical and practical aspects, to run classification experiments on different data sets so that the pros and cons of different techniques can be understood. Classification of the text was necessary for the spreadsheet columns classification. The work used convolutional and recurrent neural networks, trained on samples from five classes. Also, was made an attempt to classify unknowns for a neural network of classes, with an ensemble of four networks.",
            "source_url": "https:\/\/openalex.org\/W2766751493",
            "pdf_url": "",
            "doi": "",
            "handle": "",
            "repository_name": "BIBSYS Brage (BIBSYS (Norway))",
            "source_record_id": "W2766751493",
            "other_sources": "",
            "verification_status": "needs_review",
            "created_at": "2026-11-15 16:52:58",
            "updated_at": "2026-11-15 16:52:58"
        },
        {
            "id": 1146,
            "title": "Functional programming paradigm for machine learning algorithms in data mining",
            "title_ar": "",
            "title_en": "Functional programming paradigm for machine learning algorithms in data mining",
            "author": "Miguel Fernández de Alarcón Gervás",
            "supervisor": "",
            "degree_type": "unspecified",
            "degree_evidence": "",
            "university": "Universidad Autónoma de Madrid",
            "university_source": "repository_host",
            "college": "",
            "department": "",
            "country": "Spain",
            "governorate": "",
            "publication_year": 2019,
            "language": "en",
            "research_domain": "medical-ai",
            "research_subdomain": "cnn",
            "categories": "machine-learning; deep-learning; computer-vision; medical-ai; robotics; data-mining; cnn",
            "keywords": "",
            "abstract": "Data Mining and Machine Learning have experienced a significant rise in the past few decades, due to the increasing computational power, as well as to the quantity and availability of data which we currently have access to. This amount of data is always growing and facilitates the arrival of technologies to process them in order to obtain some benefit out of it, from autonomous driving to enhancements in the diagnosis and treatment of diseases. The programming language most widely used in data mining is Python, primarily because of its versatility and the number of libraries that are available for data processing, the different machine learning algorithms and tools to provide visual analysis of datasets and results. The goal of this project is to compare a functional programming paradigm to Python. Our choice of functional programming language is Haskell, owing to its purely functional nature. The study aims to compare the two languages based on the results of their performance when using two common classification algorithms: Random Forest (RF) and Convolutional Neural Networks (CNNs). The experimental results lean towards Python being the better solution, with running times of up to ten times faster and a third of the memory consumption in both Random Forests and Feed Forward Neural Networks (FFNN). The differences in performance were not as significant for CNNs, with Haskell needing around 1.5 times the amount of time Python requires, although memory is still around 2-3 times as much. Thus, we can conclude that Python is still the language to beat in the field of machine learning. Despite this, Haskell can still be used as a solution to other problems that can make use of its best qualities, which include its strong typing, safety because of its lack of side effects and its ease to safely parallelize code.",
            "source_url": "https:\/\/openalex.org\/W3120439944",
            "pdf_url": "https:\/\/repositorio.uam.es\/bitstream\/10486\/688868\/1\/fernandez_de_alarcon_gerv%c3%a1s_miguel_tfg.pdf",
            "doi": "",
            "handle": "",
            "repository_name": "Biblos-e Archivo (Universidad Autónoma de Madrid)",
            "source_record_id": "W3120439944",
            "other_sources": "",
            "verification_status": "needs_review",
            "created_at": "2026-11-15 16:52:58",
            "updated_at": "2026-11-15 16:52:58"
        },
        {
            "id": 1147,
            "title": "PENGARUH PROSES DISKRITISASI FAYYAD IRANI PADA AKURASI DATA MINING KLASIFIKASI NAÏVE BAYES",
            "title_ar": "",
            "title_en": "PENGARUH PROSES DISKRITISASI FAYYAD IRANI PADA AKURASI DATA MINING KLASIFIKASI NAÏVE BAYES",
            "author": "Ahmad Halim Prabowo ; Rifkie Primartha",
            "supervisor": "",
            "degree_type": "unspecified",
            "degree_evidence": "",
            "university": "",
            "university_source": "",
            "college": "",
            "department": "",
            "country": "",
            "governorate": "",
            "publication_year": 2019,
            "language": "en",
            "research_domain": "machine-learning",
            "research_subdomain": "data-mining",
            "categories": "machine-learning; data-mining",
            "keywords": "Classification Data Mining, Naive Bayes, Fayyad-Irani’s Discretization",
            "abstract": "Data Mining Classification is a technique to classify data into a category or class. The classification process can have varying accuracy depending on the compatibility between the data and the algorithm used. One way to improve the accuracy of the classification process is to use data processing. Fayyad-Irani discretization is a pre-processing of data that converts numerical values to categorical. Fayyad-Irani's discretization has been proven to increase the accuracy of classifications using decision tree algorithms. Unlike the decision tree algorithm, the Naive Bayes algorithm is a Bayesian probability based algorithm so that it can have a different effect on the accuracy and timing of the classification. Based on the experiments conducted in this study, it is known that Fayyad-Irani Discretization has succeeded in increasing the accuracy of the Naive Bayes classification process significantly from only 29.31% to 93.26%, but with the processing time needed to be slower with time difference as much as 25.5 minutes slower than the process without discretization. Keywords: Classification Data Mining, Naive Bayes, Fayyad-Irani’s Discretization",
            "source_url": "https:\/\/openalex.org\/W3167837199",
            "pdf_url": "",
            "doi": "",
            "handle": "",
            "repository_name": "",
            "source_record_id": "W3167837199",
            "other_sources": "",
            "verification_status": "needs_review",
            "created_at": "2026-11-15 16:52:58",
            "updated_at": "2026-11-15 16:52:58"
        },
        {
            "id": 1148,
            "title": "Application of artificial intelligence, ontology and data mining for classification of judicial judgments",
            "title_ar": "",
            "title_en": "Application of artificial intelligence, ontology and data mining for classification of judicial judgments",
            "author": "Antonio Adolfo Mattos [UNIFESP] Castro",
            "supervisor": "",
            "degree_type": "unspecified",
            "degree_evidence": "",
            "university": "",
            "university_source": "",
            "college": "",
            "department": "",
            "country": "",
            "governorate": "",
            "publication_year": 2021,
            "language": "en",
            "research_domain": "machine-learning",
            "research_subdomain": "data-mining",
            "categories": "machine-learning; data-mining",
            "keywords": "",
            "abstract": "The objective of this work is to apply together ontology with bag-of-words models, similarity learning, and document classification in texts with uttered decisions. The objective is to improve the results of data mining in a database of court decisions. An automatic method of searching sentences in judicial processes related to the one under judgment is developed using the frequency term-inverse of frequency in documents model together with the Jaccard similarity coefficient, establishing weights on the co-occurrence of terms in legal texts of the same category. A dataset with document vectorization is used for supervised training of machine learning algorithms, aiming to classify new justice processes. The proposed methodology provides flexibility to the Judiciary, simulating the role of legal advisors in preparing court decisions with less time and efficiency in the search for jurisprudential standards. The results obtained show that, through accuracy metrics, the proposed model is effective and efficient, and can be applied in the process of identification of court decisions. Thus, the application of artificial intelligence, ontology, and data mining is indicated for information retrieval in court decisions.",
            "source_url": "https:\/\/openalex.org\/W7120502482",
            "pdf_url": "",
            "doi": "",
            "handle": "",
            "repository_name": "LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas)",
            "source_record_id": "W7120502482",
            "other_sources": "",
            "verification_status": "needs_review",
            "created_at": "2026-11-15 16:52:58",
            "updated_at": "2026-11-15 16:52:58"
        },
        {
            "id": 1149,
            "title": "Secure data mining of outsourced data",
            "title_ar": "",
            "title_en": "Secure data mining of outsourced data",
            "author": "Fang Liu",
            "supervisor": "",
            "degree_type": "unspecified",
            "degree_evidence": "",
            "university": "Nanyang Technological University",
            "university_source": "repository_host",
            "college": "",
            "department": "",
            "country": "Singapore",
            "governorate": "",
            "publication_year": 2016,
            "language": "en",
            "research_domain": "responsible-ai",
            "research_subdomain": "fairness",
            "categories": "machine-learning; responsible-ai; data-mining; fairness",
            "keywords": "",
            "abstract": "Organizations and individuals nowadays are more and more willing to outsource their data to save storage and management costs, especially with the push for cloud computing which is service-oriented and offers both storage and computation scalability. However, the data, once being released to a server, is no longer under its owner’s control, and its privacy and security herein become a primary concern. To this end, users usually encrypt the private data before outsourcing it, which however makes conventional data retrieve, sharing, and analysis services be very thorny and challenging as data is both big and encrypted. Under such new circumstance, diverse secure building blocks and some more complex secure data mining techniques should be considered for secure analytical computations and knowledge discovery on outsourced databases. In this thesis, we aim at investigating various secure data mining algorithms for the cloud platform where data is centralized and encrypted. To enhance the security, we select suitable cryptographic techniques to protect user’s privacy and to allow a cloud server to manipulate encrypted data. According to our objectives, we first discuss and analyze several secure issues caused by outsourcing data to the cloud, such as query executing techniques, multiple user key management, correctness and integrity verifying, privacy-preserving data mining algorithms, and so on. Second, we design some basic secure building blocks for the cloud platform, including secure set intersection and secure scalar product. Third, based on such secure building blocks, we formally develop three secure data mining protocols to perform following data mining algorithms: association rule mining, gradient descent algorithm, and SVM classification. Finally, the thesis makes the conclusion and the prospect of further research directions.",
            "source_url": "https:\/\/openalex.org\/W2354950660",
            "pdf_url": "",
            "doi": "",
            "handle": "",
            "repository_name": "DR-NTU (Nanyang Technological University)",
            "source_record_id": "W2354950660",
            "other_sources": "",
            "verification_status": "needs_review",
            "created_at": "2026-11-15 16:52:58",
            "updated_at": "2026-11-15 16:52:58"
        },
        {
            "id": 1150,
            "title": "Data mining in Breast Cancer",
            "title_ar": "",
            "title_en": "Data mining in Breast Cancer",
            "author": "Laura Carrio Viladrich",
            "supervisor": "",
            "degree_type": "unspecified",
            "degree_evidence": "",
            "university": "",
            "university_source": "",
            "college": "",
            "department": "",
            "country": "Spain",
            "governorate": "",
            "publication_year": 2016,
            "language": "en",
            "research_domain": "medical-ai",
            "research_subdomain": "rnn",
            "categories": "machine-learning; deep-learning; medical-ai; data-mining; predictive-analytics; rnn",
            "keywords": "",
            "abstract": "Machine learning and data mining methods can be the future of the clinical decision process like pathological diagnosis. In this project we studied Breast Cancer Wisconsin dataset and applied different algorithms, concretely classifiers, in order to predict the diagnosis and the prognostic of the cancer. In order to classify the different types of cancer we divided the classification in two steps and we tested different algorithms for each step. The first step is the diagnosis classification. Diagnosis consistsin predict if the cancer is malignant and benign. And the second step is the prognostic classification. Prognostic consist in predict if cancer is recurrent or non-recurrent. After applying different models for each steps the result is that the best model to predict the diagnosis is the Decision Forest model. And the best model to predict the prognostic is the Boosted Decision Tree model. So, we conclude that the two step classifier with Decision Forest model and Boosted Decision Tree model is the best classifier.",
            "source_url": "https:\/\/openalex.org\/W2599885082",
            "pdf_url": "",
            "doi": "",
            "handle": "",
            "repository_name": "RECERCAT (Consorci de Serveis Universitaris de Catalunya)",
            "source_record_id": "W2599885082",
            "other_sources": "",
            "verification_status": "needs_review",
            "created_at": "2026-11-15 16:52:58",
            "updated_at": "2026-11-15 16:52:58"
        },
        {
            "id": 1151,
            "title": "Data Mining on Deflectometric Data of Surface Defects",
            "title_ar": "",
            "title_en": "Data Mining on Deflectometric Data of Surface Defects",
            "author": "Pinja Marika Kuosmanen",
            "supervisor": "",
            "degree_type": "unspecified",
            "degree_evidence": "",
            "university": "",
            "university_source": "",
            "college": "",
            "department": "",
            "country": "Finland",
            "governorate": "",
            "publication_year": 2017,
            "language": "en",
            "research_domain": "machine-learning",
            "research_subdomain": "data-mining",
            "categories": "machine-learning; robotics; ai-applications; data-mining; ai-industry",
            "keywords": "",
            "abstract": "The objective of this thesis is to apply machine learning and data mining methods, especially classification and clustering, onto deflectometric data of surface defects found on car bodies. The data is acquired via robot-assisted automated surface inspection system, manufactured by Micro-Epsilon GmbH, called reflectCONTROL. The measurement method of reflectCONTROL is based on Phase Measuring Deflectometry. The aim is to explore the possibility of automated defect classification via learning algorithms, and to gain new insight about the deflectometric data obtained from surface inspection process via clustering. This thesis is divided into theoretical part and empirical part. Basic concepts of machine learning and methods used in empirical evaluation are introduced in the theoretical part. The methods include two classification algorithms; Random Forest Classifier and Support Vector Machines. The three clustering algorithms used are k-means, Affinity Propagation and HDBSCAN. Furthermore, dimensionality reduction methods, such as Principal Component Analysis and t-SNE are included. In addition, the possibility of using Point Feature Histograms in the context of deflectometric data and feature generation is explored. The biggest challenge related to this research is that the data set used is highly unbalanced, the biggest class dominating over others in the learning tasks. The empirical study indicates that Random Forest Classifier and Support Vector Machines perform very similarly in classification tasks. Furthermore, it is possible to distinguish between different classes using multiclass classification on balanced data. It was also found via silhouette analysis and dimensionality reduction, that internal structure exists in the data, but it does not correspond to the human-assigned class labels of the defects. Finally, the study indicates that Point Feature Histogram-based features do not improve the classification performance significantly, but are helpful in clustering tasks by improving the correspondence between internal structure and human-assigned labels. The results of this study are promising for further research, suggesting that it is possible to conduct research on unlabeled data via clustering, and distinguish between different defect classes using appropriately selected data.",
            "source_url": "https:\/\/openalex.org\/W2759018742",
            "pdf_url": "",
            "doi": "",
            "handle": "",
            "repository_name": "Tampere University of Technology Institutional Repository",
            "source_record_id": "W2759018742",
            "other_sources": "",
            "verification_status": "needs_review",
            "created_at": "2026-11-15 16:52:58",
            "updated_at": "2026-11-15 16:52:58"
        },
        {
            "id": 1152,
            "title": "PENERAPAN DATA MINING UNTUK MEMPREDIKSI PENJUALAN HANDPHONE PADA KONTER A CELL MENGGUNAKAN ALGORITMA BAYESIAN CLASSIFICATION",
            "title_ar": "",
            "title_en": "PENERAPAN DATA MINING UNTUK MEMPREDIKSI PENJUALAN HANDPHONE PADA KONTER A CELL MENGGUNAKAN ALGORITMA BAYESIAN CLASSIFICATION",
            "author": "Hevin Saputra",
            "supervisor": "",
            "degree_type": "unspecified",
            "degree_evidence": "",
            "university": "",
            "university_source": "",
            "college": "",
            "department": "",
            "country": "",
            "governorate": "",
            "publication_year": 2019,
            "language": "en",
            "research_domain": "machine-learning",
            "research_subdomain": "data-mining",
            "categories": "machine-learning; data-mining; predictive-analytics",
            "keywords": "data mining, algorithm of bayesian classification, the number of sales of mobile",
            "abstract": "The background of this research is the number of sales of electronic phone products in A Cell in Sleman Yogyakarta which is often uncertain. The company has a lot of sales transaction data stored in Ms. Excel. The data only serves as an archive, so the sale on A Cell decreases because it cannot predict the data to be used as A decision maker. The application of Data Mining method is very necessary to calculate the classification of the number of mobile phone sales that function get the percentage result of accuracy of each brand of handphone. The system can improve and build systems that are still less than optimal. In evaluating the number of mobile phone sales implemented the implementation of data mining using Bayesian classification algorithm to get the best transaction data from the results of the sales of mobile phone products that have been in prediction. Therefore, through the application of data mining using Bayesian classification algorithm is expected by the method can be used as a sales strategy to assist in increasing mobile phone sales. Keywords: data mining, algorithm of bayesian classification, the number of sales of mobile",
            "source_url": "https:\/\/openalex.org\/W2991485768",
            "pdf_url": "",
            "doi": "",
            "handle": "",
            "repository_name": "",
            "source_record_id": "W2991485768",
            "other_sources": "",
            "verification_status": "needs_review",
            "created_at": "2026-11-15 16:52:58",
            "updated_at": "2026-11-15 16:52:58"
        },
        {
            "id": 1153,
            "title": "Data mining in computational finance",
            "title_ar": "",
            "title_en": "Data mining in computational finance",
            "author": "Swati Jadhav",
            "supervisor": "",
            "degree_type": "unspecified",
            "degree_evidence": "",
            "university": "Cranfield University",
            "university_source": "repository_host",
            "college": "",
            "department": "",
            "country": "United Kingdom",
            "governorate": "",
            "publication_year": 2017,
            "language": "en",
            "research_domain": "machine-learning",
            "research_subdomain": "data-mining",
            "categories": "machine-learning; data-mining; predictive-analytics; optimization",
            "keywords": "",
            "abstract": "Computational finance is a relatively new discipline whose birth can be traced back to early 1950s. Its major objective is to develop and study practical models focusing on techniques that apply directly to financial analyses. The large number of decisions and computationally intensive problems involved in this discipline make data mining and machine learning models an integral part to improve, automate, and expand the current processes. One of the objectives of this research is to present a state-of-the-art of the data mining and machine learning techniques applied in the core areas of computational finance. Next, detailed analysis of public and private finance datasets is performed in an attempt to find interesting facts from data and draw conclusions regarding the usefulness of features within the datasets. Credit risk evaluation is one of the crucial modern concerns in this field. Credit scoring is essentially a classification problem where models are built using the information about past applicants to categorise new applicants as ‘creditworthy’ or ‘non-creditworthy’. We appraise the performance of a few classical machine learning algorithms for the problem of credit scoring. Typically, credit scoring databases are large and characterised by redundant and irrelevant features, making the classification task more computationally-demanding. Feature selection is the process of selecting an optimal subset of relevant features. We propose an improved information-gain directed wrapper feature selection method using genetic algorithms and successfully evaluate its effectiveness against baseline and generic wrapper methods using three benchmark datasets. One of the tasks of financial analysts is to estimate a company’s worth. In the last piece of work, this study predicts the growth rate for earnings of companies using three machine learning techniques. We employed the technique of lagged features, which allowed varying amounts of recent history to be brought into the prediction task, and transformed the time series forecasting problem into a supervised learning problem. This work was applied on a private time series dataset.",
            "source_url": "https:\/\/openalex.org\/W3142208920",
            "pdf_url": "",
            "doi": "",
            "handle": "",
            "repository_name": "CERES (Cranfield University)",
            "source_record_id": "W3142208920",
            "other_sources": "",
            "verification_status": "needs_review",
            "created_at": "2026-11-15 16:52:58",
            "updated_at": "2026-11-15 16:52:58"
        },
        {
            "id": 1155,
            "title": "Mining heterogeneous enterprise data",
            "title_ar": "",
            "title_en": "Mining heterogeneous enterprise data",
            "author": "Xinxin Jiang",
            "supervisor": "",
            "degree_type": "unspecified",
            "degree_evidence": "",
            "university": "University of Technology Sydney",
            "university_source": "repository_host",
            "college": "",
            "department": "",
            "country": "Australia",
            "governorate": "",
            "publication_year": 2018,
            "language": "en",
            "research_domain": "deep-learning",
            "research_subdomain": "data-mining",
            "categories": "machine-learning; deep-learning; ai-applications; data-mining; ai-industry",
            "keywords": "",
            "abstract": "Heterogeneity is becoming one of the key characteristics inside enterprise data, because the current nature of globalization and competition stress the importance of leveraging huge amounts of enterprise accumulated data, according to various organizational processes, resources and standards. Effectively deriving meaningful insights from complex large-scaled heterogeneous enterprise data poses an interesting, but critical challenge. The aim of this thesis is to investigate the theoretical foundations of mining heterogeneous enterprise data in light of the above challenges and to develop new algorithms and frameworks that are able to effectively and efficiently consider heterogeneity in four elements of the data: objects, events, context, and domains. Objects describe a variety of business roles and instruments involved in business systems. Object heterogeneity means that object information at both the data and structural level is heterogeneous. The cost-sensitive hybrid neural network (Cs-HNN) proposed leverages parallel network architectures and an algorithm specifically designed for minority classification to generate a robust model for learning heterogeneous objects. Events trace an object’s behaviours or activities. Event heterogeneity reflects the level of variety in business events and is normally expressed in the type and format of features. The approach proposed in this thesis focuses on fleet tracking as a practical example of an application with a high degree of event heterogeneity. Context describes the environment and circumstances surrounding objects and events. Context heterogeneity reflects the degree of diversity in contextual features. The coupled collaborative filtering (CCF) approach proposed in this thesis is able to provide context-aware recommendations by measuring the non-independent and identically distributed (non-IID) relationships across diverse contexts. Domains are the sources of information and reflect the nature of the business or function that has generated the data. The cross-domain deep learning (Cd-DLA) proposed in this thesis provides a potential avenue to overcome the complexity and nonlinearity of heterogeneous domains. Each of the approaches, algorithms, and frameworks for heterogeneous enterprise data mining presented in this thesis outperform the state-of-the-art methods in a range of backgrounds and scenarios, as evidenced by a theoretical analysis, an empirical study, or both. All outcomes derived from this research have been published or accepted for publication, and the follow-up work has also been recognised, which demonstrates scholarly interest in mining heterogeneous enterprise data as a research topic. However, despite this interest, heterogeneous data mining still holds increasing attractive opportunities for further exploration and development in both academia and industry.",
            "source_url": "https:\/\/openalex.org\/W2910858813",
            "pdf_url": "",
            "doi": "",
            "handle": "",
            "repository_name": "OPUS - Open Publications of UTS Scholars (University of Technology Sydney)",
            "source_record_id": "W2910858813",
            "other_sources": "",
            "verification_status": "needs_review",
            "created_at": "2026-11-15 16:52:59",
            "updated_at": "2026-11-15 16:52:59"
        },
        {
            "id": 1156,
            "title": "A data mining approach for automated classification of Alzheimer's disease",
            "title_ar": "",
            "title_en": "A data mining approach for automated classification of Alzheimer's disease",
            "author": "Alexander Luke Spedding",
            "supervisor": "",
            "degree_type": "unspecified",
            "degree_evidence": "",
            "university": "University of Reading",
            "university_source": "repository_host",
            "college": "",
            "department": "",
            "country": "United Kingdom",
            "governorate": "",
            "publication_year": 2018,
            "language": "en",
            "research_domain": "medical-ai",
            "research_subdomain": "data-mining",
            "categories": "machine-learning; computer-vision; medical-ai; data-mining; predictive-analytics; optimization",
            "keywords": "",
            "abstract": "This work presents the creation of classifiers able to automatically diagnose Alzheimer’s disease from structural magnetic resonance images. Measurements of regions inside the human brain and how they relate to a diagnosis of Alzheimer’s disease are investigated. A genetic algorithm is used to extract a subset of brain measurements which have some of the highest predictive power when compared to the rest of the measurements. A descriptive classifier is created which uses the size of each of the hippocampal volumes of a subject and compares it to the distribution of other subjects. Based on how the individual subject’s measurements compares to the distribution, we can determine whether it is an Alzheimer’s disease predictive volume. This classifier achieves an accuracy equivalent to state-of-the-art approaches. A second descriptive classifier is created using a regression model to predict a healthy subject’s age and applying this to Alzheimer’s disease positive subjects to generate an apparent brain age. The classification accuracy of when the apparent brain age is compared to the subject’s real age is comparable to the state-of-the-art methods in the literature.",
            "source_url": "https:\/\/openalex.org\/W2981015562",
            "pdf_url": "",
            "doi": "",
            "handle": "",
            "repository_name": "CentAUR (University of Reading)",
            "source_record_id": "W2981015562",
            "other_sources": "",
            "verification_status": "needs_review",
            "created_at": "2026-11-15 16:52:59",
            "updated_at": "2026-11-15 16:52:59"
        },
        {
            "id": 1157,
            "title": "Healthcare data mining from multi-source data",
            "title_ar": "",
            "title_en": "Healthcare data mining from multi-source data",
            "author": "Ling Chen",
            "supervisor": "",
            "degree_type": "unspecified",
            "degree_evidence": "",
            "university": "",
            "university_source": "",
            "college": "",
            "department": "",
            "country": "Australia",
            "governorate": "",
            "publication_year": 2017,
            "language": "en",
            "research_domain": "medical-ai",
            "research_subdomain": "data-mining",
            "categories": "machine-learning; medical-ai; data-mining; predictive-analytics",
            "keywords": "",
            "abstract": "The big challenge is changing the way we acquire, store, analyse, and draw conclusions from data. How we effectively and efficiently mine the data from possibly multiple sources and extract useful information is a critical question. Increasing research attention has been drawn to healthcare data mining, with an ultimate goal to improve the quality of care. The human body is complex and so too the data collected in treating it. Data noise that is often introduced via the collection process makes building Data Mining models a challenging task. This thesis focuses on the classification tasks of mining healthcare data, with the goal of improving the effectiveness of health risk prediction. In particular, we developed algorithms to address issues identified from real healthcare data, such as feature extraction, heterogeneity, label uncertainty, and large unlabeled data. The three main contributions of this research are as follows. First, we developed a new health index called Personal Health Index (PHI) that scores a person's health status based on the examination records of a given population. Second, we identified the key characteristics of the real datasets and issues that were associated with the data. Third, we developed classification algorithms to cope with those issues, particularly, the label uncertainty and large unlabeled data issues. This research takes one step forward towards scoring personal health based on mining increasingly large health records. Particularly, it pioneers exploring the mining of GHE data and tackles the associated challenges. It is our anticipation that in the near future, more robust data-mining-based health scoring systems will be available for healthcare professionals to understand people's health status and thus improve the quality of care.",
            "source_url": "https:\/\/openalex.org\/W2602506549",
            "pdf_url": "",
            "doi": "10.14264\/uql.2017.365",
            "handle": "",
            "repository_name": "The University of Queensland",
            "source_record_id": "W2602506549",
            "other_sources": "",
            "verification_status": "needs_review",
            "created_at": "2026-11-15 16:52:59",
            "updated_at": "2026-11-15 16:52:59"
        },
        {
            "id": 1158,
            "title": "Achieving Consumable Big Data Analytics by Distributing Data Mining Algorithms",
            "title_ar": "",
            "title_en": "Achieving Consumable Big Data Analytics by Distributing Data Mining Algorithms",
            "author": "Shady Khalifa",
            "supervisor": "",
            "degree_type": "unspecified",
            "degree_evidence": "",
            "university": "Queen's University Library",
            "university_source": "repository_host",
            "college": "",
            "department": "",
            "country": "Canada",
            "governorate": "",
            "publication_year": 2017,
            "language": "en",
            "research_domain": "computer-vision",
            "research_subdomain": "data-mining",
            "categories": "machine-learning; computer-vision; data-mining; predictive-analytics",
            "keywords": "",
            "abstract": "Businesses look at Big Data as an opportunity to gain insights for improving their services. The derivation of such insights requires using different data mining techniques. Mature data mining tools like WEKA or R have been in development for years. They implement a large number of data mining algorithms and can support sophisticated Analytics. However, these mature tools are designed to run on a single machine making them unsuitable to handle Big Data. Using these tools requires data mining and statistics knowledge, and some of them, like R, are hard to learn. Businesses do not always have the technical skills required to carry on such Analytics. Even if they do, it is challenging to find a tool with the needed algorithms that supports distributed processing to handle the Big Data high arrival velocity and large volumes. The Businesses’ analytical requirements can be addressed by Consumable Big Data Analytics, that is, solutions that allow businesses to do Big Data Analytics themselves using their in-house expertise. In this work, we provide a Consumable Analytics solution to meet the businesses’ analytical needs. First, we conduct a survey of existing Analytics solutions to identify possible areas of improvement to provide Consumable Analytics. Second, instead of developing distributed data mining algorithms to handle Big Data, we develop the Data Mining Distribution (DMD) algorithm and the Label-Aware Disjoint Partitioning (LADP) algorithm to distribute the execution of all existing single-machine data mining algorithms without rewriting a single line of their code. This gives users the flexibility to use any available data mining library, have algorithms like Hoeffding Tree run 70% to 95% faster and achieve up to 18% increase in prediction accuracy. Third, we develop the free and open source QDrill solution to implement our DMD and LADP algorithms for distributed Analytics. QDrill implements our proposed Distributed Analytics Query Language (DAQL) interface that adds Analytics capabilities to the regular SQL syntax and allows integration with Business Intelligence (BI) tools. This allows businesses to use their in-house expertise to do Big Data Analytics using the spreadsheets and visualizations of their BI tools.",
            "source_url": "https:\/\/openalex.org\/W2608234461",
            "pdf_url": "",
            "doi": "",
            "handle": "",
            "repository_name": "QSpace (Queen's University Library)",
            "source_record_id": "W2608234461",
            "other_sources": "",
            "verification_status": "needs_review",
            "created_at": "2026-11-15 16:52:59",
            "updated_at": "2026-11-15 16:52:59"
        },
        {
            "id": 1303,
            "title": "Sentiment analysis with machine learning",
            "title_ar": "",
            "title_en": "",
            "author": "Αικατερίνη Χριστοπούλου",
            "supervisor": "",
            "degree_type": "unspecified",
            "degree_evidence": "",
            "university": "",
            "university_source": "",
            "college": "",
            "department": "",
            "country": "Greece",
            "governorate": "",
            "publication_year": 2017,
            "language": "el",
            "research_domain": "nlp",
            "research_subdomain": "sentiment-analysis",
            "categories": "machine-learning; nlp; data-mining; sentiment-analysis",
            "keywords": "",
            "abstract": "H συνεχόμενη ανάπτυξη του διαδικτύου δημιούργησε νέους τρόπους επικοινωνίας. Τα social media παράγουν ένα τεράστιο όγκο δεδομένων σε μορφή κειμένου, τα οποία παρέχουν πληροφορίες για τις απόψεις και τα συναισθήματα των χρηστών. Σκοπός της Εξόρυξης Δεδομένων (Data Mining) και Ανάλυσης Συναισθήματος (Sentiment Analysis) είναι η επεξεργασία των πληροφοριών αυτών και η εξαγωγή συμπερασμάτων ως προς τα συναισθήματα των χρηστών και τη πολικότητα του κειμένου. Το οποίο είναι πολύ χρήσιμο κυρίως στην εξέλιξη και ανάπτυξη των εταιρειών. Η παρούσα διπλωματική εργασία μελετάει τις τεχνικές και τα εργαλεία της Ανάλυσης Συναισθήματος. Έπειτα, εξετάζονται οι κατηγορίες των τεχνικών Ανάλυσης Συναισθήματος, οι οποίες είναι οι τεχνικές με λεξικά, τεχνικές με επιβλεπόμενη και μη-επιβλεπόμενη μηχανική μάθηση. Στη συνέχεια γίνεται μελέτη και σύγκριση διαφορετικών μοντέλων κατηγοριοποίησης κειμένων από σελίδες κριτικής ταινιών (IMDb). Αλγόριθμοι που θα χρησιμοποιηθούν είναι ο Πολυωνυμικός «Αφελής» Bayes (Multinomial Naive Bayes) και οι Μηχανές Διανυσμάτων Υποστήριξης (SVM). Τα μοντέλα κατηγοριοποίησης υλοποιούνται μέσω του προγραμματιστικού περιβάλλοντος Weka.",
            "source_url": "https:\/\/openalex.org\/W7162359589",
            "pdf_url": "",
            "doi": "",
            "handle": "",
            "repository_name": "Νημερτής",
            "source_record_id": "W7162359589",
            "other_sources": "",
            "verification_status": "needs_review",
            "created_at": "2026-11-15 16:53:00",
            "updated_at": "2026-11-15 16:53:00"
        },
        {
            "id": 1307,
            "title": "Sentiment analysis on Twitter data using machine learning",
            "title_ar": "",
            "title_en": "Sentiment analysis on Twitter data using machine learning",
            "author": "Ravikumar Patel",
            "supervisor": "",
            "degree_type": "unspecified",
            "degree_evidence": "",
            "university": "Laurentian University",
            "university_source": "repository_host",
            "college": "",
            "department": "",
            "country": "Canada",
            "governorate": "",
            "publication_year": 2018,
            "language": "en",
            "research_domain": "nlp",
            "research_subdomain": "sentiment-analysis",
            "categories": "machine-learning; computer-vision; nlp; data-mining; sentiment-analysis; speech-recognition",
            "keywords": "",
            "abstract": "In the world of social media people are more responsive towards product or certain events that are currently occurring. This response given by the user is in form of raw textual data (Semi Structured Data) in different languages and terms, which contains noise in data as well as critical information that encourage the analyst to discover knowledge and pattern from the dataset available. This is useful for decision making and taking strategic decision for the future market. To discover this unknown information from the linguistic data Natural Language Processing (NLP) and Data Mining techniques are most focused research terms used for sentiment analysis. In the derived approach the analysis on Twitter data to detect sentiment of the people throughout the world using machine learning techniques. Here the data set available for research is from Twitter for world cup Soccer 2014, held in Brazil. During this period, many people had given their opinion, emotion and attitude about the game, promotion, players. By filtering and analyzing the data using natural language processing techniques, and sentiment polarity has been calculated based on the emotion word detected in the user tweets. The data set is normalized to be used by machine learning algorithm and prepared using natural language processing techniques like Word Tokenization, Stemming and lemmatization, POS (Part of speech) Tagger, NER (Name Entity recognition) and parser to extract emotions for the textual data from each tweet. This approach is implemented using Python programming language and Natural Language Toolkit (NLTK), which is openly available for academic as well as for research purpose. Derived algorithm extracts emotional words using WordNet with its POS (Part-of-Speech) for the word in a sentence that has a meaning in current context, and is assigned sentiment polarity using ‘SentWordNet’ Dictionary or using lexicon based method. The resultant polarity assigned is further analyzed using Naïve Bayes and SVM (support vector Machine) machine learning algorithm and visualized data on WEKA platform. Finally, the goal is to compare both the results of implementation and prove the best approach for sentiment analysis on social media for semi structured data.",
            "source_url": "https:\/\/openalex.org\/W7071399435",
            "pdf_url": "",
            "doi": "",
            "handle": "",
            "repository_name": "Lu Zone Ul (Laurentian University)",
            "source_record_id": "W7071399435",
            "other_sources": "",
            "verification_status": "needs_review",
            "created_at": "2026-11-15 16:53:00",
            "updated_at": "2026-11-15 16:53:00"
        },
        {
            "id": 1322,
            "title": "Multiclass sentiment analysis: a comprehensive approach the use of machine learning",
            "title_ar": "",
            "title_en": "Multiclass sentiment analysis: a comprehensive approach the use of machine learning",
            "author": "Allisfrank dos Santos",
            "supervisor": "",
            "degree_type": "unspecified",
            "degree_evidence": "",
            "university": "",
            "university_source": "",
            "college": "",
            "department": "",
            "country": "",
            "governorate": "",
            "publication_year": 2019,
            "language": "en",
            "research_domain": "nlp",
            "research_subdomain": "sentiment-analysis",
            "categories": "machine-learning; nlp; data-mining; sentiment-analysis",
            "keywords": "",
            "abstract": "In the globalized world, the analysis of data generated from the most varied sources, especially the textual ones, has become of great importance for the acquisition of knowledge and information. In this respect, the Internet and social networks make up the main textual database. The Sentiment Analysis is a form of data mining in text format, and the purpose of this type of analysis is to identify and \/ or analyze users' opinions about an entity or about sentiment related to various topics. Several researchers have used the Sentiment Analysis to understand user behavior through polarity, which can be separated into two or three classes. However, the challenge ahead is to find ways that go beyond the traditional classification and achieve a more real analysis of the expressed feelings, exploring t he idea of multiclass analysis (through emotional classes). Based on these facts, this paper aims to study aspects of the Sentiment Analysis related to the number of classes of emotions to be analyzed, as well as the representation form of the texts to be submitted for classification. For this, classic Machine Learning algorithms (SVM, kNN and Naive Bayes) as well as vectorization techniques such as TF - IDF and Word2Vec were used. The results show that a reduced number of classes allied to the use of Word2Vec as a textual representation method improves the classification result, especially with the use of the SVM classifier, obtaining an accuracy of 58.8% for the emotional base and 68.6% for the basis of polarity.",
            "source_url": "https:\/\/openalex.org\/W7120433465",
            "pdf_url": "",
            "doi": "",
            "handle": "",
            "repository_name": "LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas)",
            "source_record_id": "W7120433465",
            "other_sources": "",
            "verification_status": "needs_review",
            "created_at": "2026-11-15 16:53:01",
            "updated_at": "2026-11-15 16:53:01"
        }
    ]
}