1 resultado para Resilient
em Memorial University Research Repository
Filtro por publicador
- JISC Information Environment Repository (2)
- KUPS-Datenbank - Universität zu Köln - Kölner UniversitätsPublikationsServer (1)
- Abertay Research Collections - Abertay University’s repository (1)
- Academic Archive On-line (Stockholm University; Sweden) (1)
- Academic Research Repository at Institute of Developing Economies (2)
- Acceda, el repositorio institucional de la Universidad de Las Palmas de Gran Canaria. España (1)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (5)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (1)
- Aquatic Commons (5)
- Archive of European Integration (9)
- Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco (3)
- Aston University Research Archive (20)
- B-Digital - Universidade Fernando Pessoa - Portugal (1)
- Biblioteca de Teses e Dissertações da USP (7)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (4)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (1)
- Biblioteca Digital de Teses e Dissertações Eletrônicas da UERJ (4)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (27)
- Boston University Digital Common (3)
- Brock University, Canada (1)
- Bucknell University Digital Commons - Pensilvania - USA (3)
- CaltechTHESIS (1)
- Cambridge University Engineering Department Publications Database (19)
- CentAUR: Central Archive University of Reading - UK (33)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (1)
- Comissão Econômica para a América Latina e o Caribe (CEPAL) (1)
- CORA - Cork Open Research Archive - University College Cork - Ireland (7)
- Corvinus Research Archive - The institutional repository for the Corvinus University of Budapest (2)
- CUNY Academic Works (1)
- Deakin Research Online - Australia (93)
- Digital Commons - Michigan Tech (4)
- Digital Commons @ DU | University of Denver Research (1)
- Digital Commons at Florida International University (12)
- Digital Peer Publishing (1)
- DigitalCommons - The University of Maine Research (2)
- DigitalCommons@The Texas Medical Center (3)
- DRUM (Digital Repository at the University of Maryland) (2)
- Duke University (2)
- Ecology and Society (6)
- eResearch Archive - Queensland Department of Agriculture; Fisheries and Forestry (14)
- Glasgow Theses Service (1)
- Greenwich Academic Literature Archive - UK (2)
- Helda - Digital Repository of University of Helsinki (4)
- Illinois Digital Environment for Access to Learning and Scholarship Repository (1)
- Indian Institute of Science - Bangalore - Índia (11)
- Institutional Repository of Leibniz University Hannover (1)
- Instituto Politécnico do Porto, Portugal (2)
- Instituto Superior de Psicologia Aplicada - Lisboa (2)
- Memorial University Research Repository (1)
- Ministerio de Cultura, Spain (1)
- National Center for Biotechnology Information - NCBI (1)
- Nottingham eTheses (2)
- Plymouth Marine Science Electronic Archive (PlyMSEA) (7)
- Portal de Revistas Científicas Complutenses - Espanha (3)
- Publishing Network for Geoscientific & Environmental Data (22)
- QSpace: Queen's University - Canada (1)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (55)
- Queensland University of Technology - ePrints Archive (126)
- RDBU - Repositório Digital da Biblioteca da Unisinos (1)
- REPOSITÓRIO ABERTO do Instituto Superior Miguel Torga - Portugal (1)
- Repositório Científico da Universidade de Évora - Portugal (1)
- Repositório Científico do Instituto Politécnico de Lisboa - Portugal (2)
- Repositório digital da Fundação Getúlio Vargas - FGV (9)
- Repositório Institucional da Universidade de Aveiro - Portugal (3)
- Repositório Institucional da Universidade de Brasília (2)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (44)
- Research Open Access Repository of the University of East London. (2)
- RUN (Repositório da Universidade Nova de Lisboa) - FCT (Faculdade de Cienecias e Technologia), Universidade Nova de Lisboa (UNL), Portugal (6)
- SAPIENTIA - Universidade do Algarve - Portugal (1)
- Universidad de Alicante (4)
- Universidad del Rosario, Colombia (19)
- Universidad Politécnica de Madrid (25)
- Universidade Complutense de Madrid (2)
- Universidade de Lisboa - Repositório Aberto (1)
- Universidade dos Açores - Portugal (1)
- Universidade Federal do Pará (7)
- Universidade Federal do Rio Grande do Norte (UFRN) (5)
- Universidade Metodista de São Paulo (1)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (5)
- Université de Montréal (2)
- Université de Montréal, Canada (15)
- Université Laval Mémoires et thèses électroniques (1)
- University of Queensland eSpace - Australia (5)
- University of Washington (5)
- WestminsterResearch - UK (6)
- Worcester Research and Publications - Worcester Research and Publications - UK (2)
Resumo:
The social media classification problems draw more and more attention in the past few years. With the rapid development of Internet and the popularity of computers, there is astronomical amount of information in the social network (social media platforms). The datasets are generally large scale and are often corrupted by noise. The presence of noise in training set has strong impact on the performance of supervised learning (classification) techniques. A budget-driven One-class SVM approach is presented in this thesis that is suitable for large scale social media data classification. Our approach is based on an existing online One-class SVM learning algorithm, referred as STOCS (Self-Tuning One-Class SVM) algorithm. To justify our choice, we first analyze the noise-resilient ability of STOCS using synthetic data. The experiments suggest that STOCS is more robust against label noise than several other existing approaches. Next, to handle big data classification problem for social media data, we introduce several budget driven features, which allow the algorithm to be trained within limited time and under limited memory requirement. Besides, the resulting algorithm can be easily adapted to changes in dynamic data with minimal computational cost. Compared with two state-of-the-art approaches, Lib-Linear and kNN, our approach is shown to be competitive with lower requirements of memory and time.