search query: @keyword tf-idf / total: 2
results-list
reference: 2 / 2
« previous | next »
Author:Sayfullina, Luiza
Title:Reducing Sparsity in Sentiment Analysis Data using Novel Dimensionality Reduction Approaches
Publication type:Master's thesis
Publication year:2014
Pages:69      Language:   eng
Department/School:Perustieteiden korkeakoulu
Main subject:Machine Learning and Data Mining   (SCI3015)
Supervisor:Karhunen, Juha
Instructor:Miche, Yoan
Electronic version URL: http://urn.fi/URN:NBN:fi:aalto-201411123023
OEVS:
Electronic archive copy is available via Aalto Thesis Database.
Instructions
close

Reading digital theses in the closed network of the Aalto University Harald Herlin Learning Centre

In the closed network of Learning Centre you can read digital and digitized theses not available in the open network.

The Learning Centre contact details and opening hours: https://learningcentre.aalto.fi/en/harald-herlin-learning-centre/

You can read theses on the Learning Centre customer computers, which are available on all floors.

Logging on to the customer computers

  • Aalto University staff members log on to the customer computer using the Aalto username and password.
  • Other customers log on using a shared username and password.

Opening a thesis

  • On the desktop of the customer computers, you will find an icon titled:

    Aalto Thesis Database

  • Click on the icon to search for and open the thesis you are looking for from Aaltodoc database. You can find the thesis file by clicking the link on the OEV or OEVS field.

Reading the thesis

  • You can either print the thesis or read it on the customer computer screen.
  • You cannot save the thesis file on a flash drive or email it.
  • You cannot copy text or images from the file.
  • You cannot edit the file.

Printing the thesis

  • You can print the thesis for your personal study or research use.
  • Aalto University students and staff members may print black-and-white prints on the PrintingPoint devices when using the computer with personal Aalto username and password. Color printing is possible using the printer u90203-psc3, which is located near the customer service. Color printing is subject to a charge to Aalto University students and staff members.
  • Other customers can use the printer u90203-psc3. All printing is subject to a charge to non-University members.
Location:P1 Ark Aalto  2015   | Archive
Keywords:sentiment analysis
tf-idf
word clustering
sparsity
Abstract (eng):No aspect of our mental life is more important to the quality and meaning of our existence than emotions and sentiments.
Recently researches have introduced many Machine Learning approaches to analyse sentiment from public blogs, social networks, etc.
Due to the sparse and high-dimensional textual datasets one needs Feature Selection before applying classifiers.
The scope of my thesis are Dimensionality Reduction techniques for predicting one of the two opposite sentiments, specifically for Polarity Classification.

The greatest challenge for Text Classification problems in general is data sparsity.
Especially it is for Bag-of-words model, where the document is represented by the number of occurrences of each term in the vocabulary.
Hence it can be hard for a classifier to understand the relationships between all the words in the initial vocabulary when training set is not large enough.

In this thesis I investigate possible steps required to decrease the sparsity: setting the vocabulary, using sentiment dictionaries, choosing data representation and Dimensionality Reduction methods and their underlying strategies.
I describe fast and intuitive unsupervised and supervised tf-idf scores for Feature Ranking.
In addition, Word Clustering algorithm for merging the words with very close semantical meaning is introduced.
By clustering semantically close words we decrease the feature space with minimum loss of information compared to Feature Selection, where we simply omit the features.

Polarity Classification problem is investigated on two datasets: SemEval 2013 Twitter Sentiment Analysis and KDD Project Excitement Prediction using Extreme Learning Machine.
Best performance for both datasets was achieved by using the proposed Word Clustering and supervised tf-idf score with 20 times less features than original vocabulary size.
ED:2014-11-16
INSSI record number: 50049
+ add basket
« previous | next »
INSSI