2015 Fifteenth International Conference on Advances in ICT for Emerging Regions (ICTer) 2015
DOI: 10.1109/icter.2015.7377685
|View full text |Cite
|
Sign up to set email alerts
|

A hybrid decision tree for printed Tamil character recognition using SVMs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
9
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
5
2
1

Relationship

1
7

Authors

Journals

citations
Cited by 11 publications
(11 citation statements)
references
References 3 publications
0
9
0
Order By: Relevance
“…A convolutional neural network for proposing in offline handwritten Tamil characters was developed with a large number of datasets [1] it sets a benchmark for character recognition HTCR using the deep learning technique which includes the convolutional neural network for feature extraction, train the model. Using CNN as the model produces an accuracy of 95.16% in result analysis through the entire model description.…”
Section: Related Workmentioning
confidence: 99%
“…A convolutional neural network for proposing in offline handwritten Tamil characters was developed with a large number of datasets [1] it sets a benchmark for character recognition HTCR using the deep learning technique which includes the convolutional neural network for feature extraction, train the model. Using CNN as the model produces an accuracy of 95.16% in result analysis through the entire model description.…”
Section: Related Workmentioning
confidence: 99%
“…Each handwritten signature image is enclosed in a tight fit rectangular boundary. The portion of the handwritten signature image outside this boundary is discarded using horizontal and vertical projection technique [12].…”
Section: Boundary Extractionmentioning
confidence: 99%
“…Ramanan et al [7] introduced a new procedure to identify Tamil characters using binary Support Vector Machine (SVM) toward multiclass classification with Decision Tree. Here Binary rooted Directed Acyclic Graph (DAG) decision was practiced for Unbalanced Decision Trees (UDT).…”
Section: Related Workmentioning
confidence: 99%
“…So that there can be 4 groupings; 11, 10, 01 and 00. This can be written as follows, P(T=1).P(T=1)+P(T=1).P(T=0)+P(T=0).P(T=1)+P(T=0).P( T=0)=1 P(T=1).P(T=0)+P(T=0).P(T=1)= 1-P 2 (T=0) -P 2 (T=1) It can be rewritten as (7) where G is the Gini index, T is the Target variable and P is the proportion of observation of the target variable. Similarly, for the categorical target variable, the Gini index will be similar only with slight modification as follows,…”
Section: A Gini Indexmentioning
confidence: 99%