![](/jspui/image/dspace_header.jpg)
Please use this identifier to cite or link to this item:
https://idr.nitk.ac.in/jspui/handle/123456789/7357
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Singh, A. | |
dc.contributor.author | Prakash, B.S. | |
dc.contributor.author | Chandrasekaran, K. | |
dc.date.accessioned | 2020-03-30T09:58:55Z | - |
dc.date.available | 2020-03-30T09:58:55Z | - |
dc.date.issued | 2017 | |
dc.identifier.citation | Proceeding - IEEE International Conference on Computing, Communication and Automation, ICCCA 2016, 2017, Vol., , pp.133-138 | en_US |
dc.identifier.uri | http://idr.nitk.ac.in/jspui/handle/123456789/7357 | - |
dc.description.abstract | This document is about the accuracy analysis of two of the most prominent classifiers present in today's academic arena. Classifiers are being used extensively in machine learning applications today and need to present a high rate of success to be considered useful. Tikhonov regularization incorporated within the Ridge Classifier is the basis for its classification. It utilises the LevenbergMarquardt algorithm for non-linear least-squares problems to classify objects. Linear Discriminant Analysis, on the other hand, utilises aspects of ANOVA[2,3] and regression analysis. LDA works by getting explicit information from the user. It needs the definition of the variables - both dependent and independent. It doesn't use any implicit assumptions in its modelling. There is no interconnection between the two variables initially. Using these two classifiers we compare their effectiveness at mapping a set of data scraped in real-time from Twitter to its corresponding generalised hashtag, and suggest why the differences, if any, arise. � 2016 IEEE. | en_US |
dc.title | A comparison of linear discriminant analysis and ridge classifier on Twitter data | en_US |
dc.type | Book chapter | en_US |
Appears in Collections: | 2. Conference Papers |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.