D. K. Santhosh Kumar

D. K. Santhosh Kumar

Auto-generated profile, based on publicly available information

D. K. Santhosh Kumar

Department of Computer Science and Engineering, St. Joseph Engineering College, Affiliated to VTU Belagavi, Mangalore, India

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

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

Representative Publications

View All Publications
2 February 2023 in SN Computer Science
Verified
Journal Article
Closed access
PDF file
GSGuru Prasad M S
Guru Prasad M S
MSM. S.
M. S.
NKNaveen Kumar
Naveen Kumar
HNH. N.
H. N.
KRK. Raju
K. Raju
SCS. Chandrappa
S. Chandrappa

11 January 2023 in SN Computer Science
Verified
Journal Article
Closed access
PDF file
SCS. Chandrappa
S. Chandrappa
MGM. S. Guruprasad
M. S. Guruprasad
HKH. N. Naveen Kumar
H. N. Naveen Kumar
KRK. Raju
K. Raju
DKD. K. Santhosh Kumar
D. K. Santhosh Kumar

12 January 2022 in International Journal of Data Science and Analytics
Verified
Journal Article
Closed access
PDF file
DKD. K. Santhosh Kumar
D. K. Santhosh Kumar
DDDEMIAN ANTONY DMELLO
DEMIAN ANTONY DMELLO

14 April 2019
Verified
Book Chapter
Closed access
PDF file
DKD. K. Santhosh Kumar
D. K. Santhosh Kumar
DDDemian Antony D‘mEllo
Demian Antony D‘mEllo

8 August 2024 in SN Computer Science
Verified
Journal Article
Closed access
PDF file
BKBasappa B. Kodada
Basappa B. Kodada
DDDEMIAN ANTONY DMELLO
DEMIAN ANTONY DMELLO
DKD. K. Santhosh Kumar
D. K. Santhosh Kumar

30 November 2022 in Research Square
Verified
Preprint
Open access
PDF file
GSGuru Prasad M S
Guru Prasad M S
NNNaveen Kumar H N
Naveen Kumar H N
MSMohd Asif Shah
Mohd Asif Shah
RKRaju K
Raju K
SKSanthosh Kumar D K
Santhosh Kumar D K
CSChandrappa S
Chandrappa S
Frequent item mining is a process wherein we extract or mine frequent itemsets from a given input dataset. Apriori algorithms and FP-growth algorithms are two types of common pattern mining algorithms. Traditional implementations of such frequent item mining algorithms tend to be inefficient when it comes to mining frequent item sets over large transactional datasets, owing to the fact that they consume a greater amount of time in performing the same. In order to tackle the issues mentioned, large transaction datasets using the extended Hadoop MapReduce Framework are considered. On the same, a novel distributed, parallel processing, frequent item mining algorithm is integrated. The analysis of the performance of the implemented algorithm proves that the performance of frequent item analysis in relation to data uploading time, HDFS disk utilization, and data processing time has improved drastically.