Suresh Reddy Gali

Suresh Reddy Gali

Auto-generated profile, based on publicly available information

Suresh Reddy Gali

Department of Information Technology, VNR Vignana Jyothi Institute of Engineering & Technology, Hyderabad 500090, Telangana, India

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 September 2017 in Future Generation Computer Systems
Verified
Journal Article
Closed access
GKGunupudi Rajesh Kumar
Gunupudi Rajesh Kumar
MNMangathayaru Nimmala
Mangathayaru Nimmala
NGNarsimha Gugulothu
Narsimha Gugulothu
SGSuresh Reddy Gali
Suresh Reddy Gali

17 November 2016
Verified
Conference Paper
Closed access
GRG. Suresh Reddy
G. Suresh Reddy
Feature dimensionality has always been one of the key challenges in text mining as it increases complexity when mining documents with high dimensionality. High dimensionality introduces sparseness, noise, and boosts the computational and space complexities. Dimensionality reduction is usually addressed by implementing either feature reduction or feature selection techniques. In this work, the problem of dimensionality reduction is addressed by achieving feature reduction through the use of a novel membership function. For feature selection, Singular value decomposition and Information gain approaches are adopted through retaining top-k features. The approach of feature reduction is compared to feature selection techniques and results prove the dimensionality reduction achieved through proposed approach is better.

27 June 2014
Verified
Conference Paper
Open access
PDF file
GSG. SureshReddy
G. SureshReddy
TRT. V. Rajinikanth
T. V. Rajinikanth
ARA. Ananda Rao
A. Ananda Rao

1 February 2014
Verified
Conference Paper
Closed access
GRG.Suresh Reddy
G.Suresh Reddy
TRT.V. Rajinikanth
T.V. Rajinikanth
ARA.Ananda Rao
A.Ananda Rao
Text clustering is an unsupervised process forming its basis solely on finding the similarity relationship between documents with the output as a set of clusters [14]. In this research, a commonality measure is defined to find commonality between two text files which is used as a similarity measure. The main idea is to apply any existing frequent item finding algorithm such as apriori or fp-tree to the initial set of text files to reduce the dimension of the input text files. A document feature vector is formed for all the documents. Then a vector is formed for all the static text input files. The algorithm outputs a set of clusters from the initial input of text files considered.

1 November 2015 in Advanced Science Letters
Verified
Journal Article
Closed access
GRG Suresh Reddy
G Suresh Reddy
TKT. V Rajini Kanth
T. V Rajini Kanth
ARA Ananda Rao
A Ananda Rao

30 November 2015 in International Journal of Data Mining & Knowledge Management Process
Verified
Journal Article
Closed access
AAAnandaRao A
AnandaRao A
SGSureshReddy G
SureshReddy G
RTRajinikanth T.V
Rajinikanth T.V