FRAMEWORK FOR CLUSTERING ON SOCIAL NETWORKING MESSAGE
Journal Title: Indian Journal of Computer Science and Engineering - Year 2016, Vol 7, Issue 3
Abstract
Normally, the messages collected from the social networking applications are highly unstructured and cluttered that pose a significant level of difficulty for applying conventional mining technique. Is such data are not filtered effectively; it will pose a greater deal of difficulty for the user if s/he wants to generate a customized level of query. This problem can be solved using clustering technique. Hence, we proposed a technique that is capable of visualizing the exact data representation of messages by applying a unique semantics operation followed by clustering. The study outcome of the technique is found to have better f1-score and accuracy in comparison to existing system of clustering social networking data.
Authors and Affiliations
Satish Babu M , Geetha Pawar
Keywords
Related Articles
- EP ID EP164709
- DOI -
- Views 86
- Downloads 0
JOINT CHANNEL ESTIMATION AND DECODING OF RAPTOR CODE ON FADING CHANNEL
In this paper, the problem of transmission of Raptor codes over fading channel is considered. We present in this paper joint decoder architecture for Raptor codes over phase coherent fading channel. The proposed scheme d...
A TESTING FRAMEWORK FOR FAULT TOLERANT COMPOSITION OF TRANSACTIONAL WEB SERVICES
Software testers have great challenges in testing of web services therefore testing technique must be developed for testing of web services. Web service composition is an active research area over last few years. This pa...
NOVEL SCHEME FOR THE REMOVAL OF BLOTCHES, BLACK BAND NOISE, STREAKS AND IMPULSE NOISE IN GRAY SCALE IMAGES
A Threshold based fixed 3x3 Non linear filter for the removal of image artifact such as blotches, black band noise, streaks and impulse is proposed. The algorithm detects the corrupted pixel, if the absolute difference b...
MODELING ORDINARY DIFFERENTIAL EQUATIONS IN MATLAB SIMULINK ®
Ordinary differential equations (ODEs) play a vital role in engineering problems. They are used to model continuous dynamical systems as initial and boundary value problems. There are several analytical and numerical met...
AUTOMATIC WEB SERVICE SELECTION BY OPTIMIZING COST OF COMPOSITION IN SLAKY COMPOSER USING ASSIGNMENT MINIMIZATION APPROACH
Web service composition is a means of building enterprises virtually by knitting relevant web services on the fly. Automatic web service composition is done dynamically at runtime. Extensive research has been done in the...