Sasikala T. is serving as Assistant Professor (Sr. Gr.) in the Department of Computer Science and Engineering, Amrita School of Engineering, Bengaluru. Currently she is pursuing Ph.D. in the area of Sentiment Analysis using Machine Learning Techniques.
Year of Publication | Title |
---|---|
2019 |
S. S. K. T and Sasikala T, “Non-Invasive System to Measure Glucose Level in Human Body”, in 3rd International Conference on Computing Methodologies and Communication [ICCMC 2019], Surya Engineering College, Erode , 2019. |
2017 |
A. P. Valli, .Uma, M., S.Pravallika, K. R., and Sasikala T, “Tracing out various diseases by analyzing twitter data applying data mining techniques”, in International Conference on Energy, Communication, Data Analytics and Soft Computing (ICECDS 2017) , Chennai, 2017. |
2017 |
A. Aki, D, K. Mohan Redd, Y, K. Reddy, Kavitha C. R., and Sasikala T, “Analyzing the real time electricity data using data mining techniques”, in International Conference On Smart Technologies For Smart Nation (SmartTechCon2017), Reva University, Bengaluru, 2017. |
2017 |
Sasikala T and Krishna, K. Sandeep, “Prognostication of Students Performance and Suggesting Suitable Learning Style for Under Performing Students ”, in 2nd International Conference on Computational Systems and Information Technology for Sustainable Solution (CSITSS-2017), R.V. College of Engineering, Bengaluru , 2017. |
2017 |
G. B. R., Dr. Deepa Gupta, and Sasikala T, “Grammar Error Detection Tool for Medical Transcription using Stop Words – POS Tags ngram Based Model ”, in 2nd International Conference on Computational Intelligence and Informatics(ICCI’17), JNTU, Hyderabad , 2017.[Abstract] Medical transcription is the process of conversion of audio files, dictated by medical experts, to electronic |
Year of Publication | Title |
---|---|
2015 |
Sasikala T, K, A. N., and R, G., “Software Based Prototype for Data Confidentiality in Databases”, International Journal of Applied Engineering Research, vol. 10, no. 14, pp. 34369-34371, 2015.[Abstract] In recent times huge amount of data is getting generated and is stored in the databases. These databases are either outsourced or maintained by the companies. The data stored can be highly confidential, but there is no guarantee whether that data is secure or not [4][6]. The databases can be attacked and sensitive information can be leaked. So to provide security for data in databases we came up with a software prototype which is cost effective, efficient and ensures high data security. This prototype encrypts the data before storing in the database with a secret using strong cryptographic algorithms and hence ensures data security. More »» |
2015 |
Sasikala T and K, R., “Matrix Approach of Apriori Algorithm using Subset Count Technique”, International Journal of Applied Engineering Research, vol. 10, 12 vol., pp. 32151-32159, 2015.[Abstract] In present days, since the size of the datasets is being increased day by day, extracting knowledge from this huge data set has become a very big issue. Particularly speaking about transactional data set, there were many approaches to find the frequent item sets. Many classical algorithms and techniques of Apriori have been proposed and used to find the frequent item sets from the huge transactional dataset. The classical algorithms scans the database repeatedly for finding frequent item sets which generally takes more execution time. In this paper we propose a new improved matrix approach with subset count to find the frequent item sets. First the given data is converted to matrix form where the items with less than minimum support count and duplicate transactions are removed, secondly each transactions are scanned for item sets and if this item set is not present in frequent item sets list the we find the subsets of this item set and add them to subset count list by incrementing the count of a particular subset. If the count of any subset is greater than minimum support then the subset is added to frequent item sets list. In this paper we have compared the existing apriori algorithm with improved matrix approach based on execution time. More »» |