Wednesday, 25 September 2019

A Comparative Study of Machine Learning Algorithms using Feature Selection Methods for Movie Review Analysis

Volume 11 Issue 3 January - March 2017

Research Paper

A Comparative Study of Machine Learning Algorithms using Feature Selection Methods for Movie Review Analysis

Rajwinder Kaur*, Prince Verma**
* M.Tech Scholar, Department of Computer Science and Engineering, CT Institute of Engineering Management and Technology, Punjab, India.
** Assistant Professor, Department of Computer Science and Engineering, CT Institute of Engineering Management and Technology, Punjab, India.
Kaur, R., and Verma, P. (2017). A Comparative Study of Machine Learning Algorithms using Feature Selection Methods for Movie Review Analysis. i-manager’s Journal on Software Engineering, 11(3), 1-9. https://doi.org/10.26634/jse.11.3.13620

Abstract

Nowadays, the analysis of social sites, such as movie reviews’ sites, facebook, news feeds, and online shopping sites has been a broad area of research and customers post a large number of reviews in the form of comments to reveal their feelings as well as opinions as positive, negative, or neutral about a particular movie, product, pictures etc. To predict the reviews of users of such websites is a complex decision making process. These types of sites help the people to take decision about products. This paper proposes a Random Forest classifier with Information Gain based feature selection method for classification of movie review datasets. The results show that Information Gain method with Random Forest classifier has better performance in terms of Accuracy, Precision, and Recall.

Survey on Semantic Indexing of High dimensional Data with Deep Learning Techniques

Volume 11 Issue 2 October - December 2016

Survey Paper

Survey on Semantic Indexing of High dimensional Data with Deep Learning Techniques

Lakshmi Haritha Medida*, Kasarapu Ramani**
* Assistant Professor, Department of Computer Science and Engineering, BVCITS, Amalapuram, A.P., India.
** Professor and Head, Department of Information Technology, Sree Vidyanikethan Engineering College (Autonomous), Tirupati, A.P., India.
Medida, L.H., and Ramani, K. (2016). Survey on Semantic Indexing of High dimensional Data with Deep Learning Techniques. i-manager’s Journal on Software Engineering, 11(2), 31-42. https://doi.org/10.26634/jse.11.2.13447

Abstract

Deep Learning is the trending area of research in Machine Learning and Pattern Recognition. Deep Learning focuses on Machine Learning tools and techniques, and applies them in resolving complications which lacks human or artificial thoughts. Deep Learning is achieved by learning over a cascade of many layers. Deep Learning handles many real world complications, such as Machine translation, Object recognition and Localization, Speech recognition, Image caption generation, Distributed representation for text, Natural Language Processing, Image Classification, etc., with its datadriven representation learning. The traditional computing is facing challenges in dealing with high-dimensional and streaming data, semantic indexing, and scalability of models. The analysis of streaming and fast-moving input data is constructive in tracking tasks such as fraud detection. In view of the above challenges, extensive advanced research work is essential for adaptation of Deep Learning algorithms to deal with issues associated with Big Data. Handling streaming data is essentially adapted by Deep Learning algorithms so as to deal with the increasing huge amounts of uninterrupted input data. A key benefit of Deep Learning is the analysis and learning of massive amounts of unsupervised data, which makes it a worthy tool for Big Data Analytics, where the input data is mostly unlabeled and un-categorized. This paper provides a detailed survey on semantic indexing techniques which will enable fast search and information retrieval.

Data Publishing in Decentralized System Using Trusty URI’s

Volume 11 Issue 2 October - December 2016

Research Paper

Data Publishing in Decentralized System Using Trusty URI’s

Y. Nandini*, E. Prakash Babu**, S. Vellinangiri***
* M.Tech Student, Department of Computer Science and Engineering, SVPCET, Puttur, India.
** Assistant Professor, Department of Computer Science and Engineering, SVPCET, Puttur, India.
***Head of the Department,Department of Computer Science and Engineering, SVPCET, Puttur, India.
Nandini, Y., Babu, E. P., and Vellinangiri, S. (2016). Data Publishing In Decentralized System Using Trusty URI’s. i-manager’s Journal on Software Engineering, 11(2), 26-30. https://doi.org/10.26634/jse.11.2.13446

Abstract

Today's web has no usual components to make computerized relics, for example, datasets, code, messages, and pictures, which are precise and stay unaltered. Digital artifacts are not modifiable to unchange, and there is no right technique to implement this perpetuity. These disappointments have a great negative effect on the adaptability to imitate the consequences of procedures that depend on web assets and furthermore it impacts regions like science where reproducibility is basic. To tackle this issue, the authors have proposed trusty URIs containing cryptographic condensations. They have also dealt with how trusty URIs will be utilized for the verification of digital artifacts, in a way that is independent of the distributed design in the instance of organized data records like Nanopublications. They exhibited how the constant of those documents end up noticeably immutable, and additionally conditions to external digital artifacts were added, and along these lies extending the scope of undeniable nature to the entire reference tree. This approach adheres to the center standards of the Web, for example, openness and decentralization, and is totally good with existing gauges and conventions. A transformative model demonstrates that these style objectives are absolutely proficient by their approach, which remains sensible for large documents.

An Overview of Big Data Security

Volume 11 Issue 2 October - December 2016

Research Paper

An Overview of Big Data Security

Rashi Srivastava*, Tanisha Gahlawat**, Parul Kalra***
* UG Scholar, Department of Information TechnologyAmity School of Technology, Noida, Uttar Pradesh, India.
**-*** Amity School of Technology, Noida, Uttar Pradesh, India.
Srivastava R., , Gahlawat, T., and Kalra, P. (2016). Comparisons of Naive Bayes, Back Propagation, Deep Learning algorithm to Measure the Performance with Make Use of Dataset. i-manager’s Journal on Software Engineering, 11(2), 20-25. https://doi.org/10.26634/jse.11.2.13445

Abstract

In today's advancing world, data is increasing day by day and due to its vast size it has become very difficult to incorporate security to all the data. Interest in security function of data is increasing due to growth of network technology. It is also increasing with development of cloud computing an area which is rich in source for information along with network traffic. This area needs security. Through this paper, the authors propose an overview of big data security problems, which includes its varieties, and challenges. It also discusses privacy concern on big data. The methodology adopted for protection is attribution selection, that is determined by the background of big data. It is also ascertained by data mining and big data features.

Realizing Internet of Things Using Arduino, ESP8266 and IIS Server and MySQL DB for Real-Time Monitoring and Controlling Multiple Fire Alarm Systems Over a Wireless TCP/IP Network

Volume 11 Issue 2 October - December 2016

Research Paper

Realizing Internet of Things Using Arduino, ESP8266 and IIS Server and MySQL DB for Real-Time Monitoring and Controlling Multiple Fire Alarm Systems Over a Wireless TCP/IP Network

P. Sharmila*, S. Shobhana**, M. Abirami***, 0****
*,** UG Scholar, Department of Electronics and Communication Engineering, SMK Fomra Institute of Technology, TamilNadu, India.
*** Assistant Professor, Department of Electronics and Communication Engineering, SMK Fomra Institute of Technology, TamilNadu, India.
**** Principal, Department of Electronics and Communication Engineering, SMK Fomra Institute of Technology, TamilNadu, India.
Sharmila, P., Shobhana, S., Abirami, M., and Eswaran, U. (2016). Realizing Internet of Things Using Arduino, ESP8266 and IIS Server and MySQL DB For Real-Time Monitoring and Controlling Multiple Fire Alarm Systems Over a Wireless TCP/IP Network. i-manager’s Journal on Software Engineering, 11(2), 13-19. https://doi.org/10.26634/jse.11.2.13444

Abstract

The aim of the project is to realize the upcoming concept of Internet of Things where every “Thing” will be connected over a network for data acquisition. The acquired data is then utilized for making better decisions in real-time environment. Early detection of fire accidents is very crucial in preventing heavy casualty and damage in any industry. Present fire detection systems employ the method of raising alarm at the site of detection. A smart system can detect fire accident and also take an action or control the output of the system in real-time based on data acquired from sensors. The role of IoT is not just controlling the output of a system in real-time, but to do the same for multiple systems by connecting them all to a centralized server over a network. Since all data is available in a centralized server, they can be monitored and controlled from remote locations.

Comparison of Naive Bayes, Back Propagation, And Deep Learning algorithm to Measure the Performance Using Datasets

Volume 11 Issue 2 October - December 2016

Research Paper

Comparison of Naive Bayes, Back Propagation, And Deep Learning algorithm to Measure the Performance Using Datasets

J. Sharmila*
Assistant Professor, Department of Computer Science, Bharathidasan University Constituent College for Women, TamilNadu, India.
Sharmila, J. (2016). Comparison of Naive Bayes, Back Propagation, Deep Learning algorithm to Measure the Performance Using Datasets. i-manager’s Journal on Software Engineering, 11(2), 1-12. https://doi.org/10.26634/jse.11.2.13443

Abstract

Mining the possible information from the web is one of the popular research topics. This paper comprises Naive Bayes, Back Propagation, and Deep Learning algorithm to describe various ranking scores on the training data set. To construct the extraction model, the authors have proposed a new algorithm for training support vector machines, known as Deep Learning. It requires the solution of a very large Quadratic Programming (QP) optimization problem. Naive Bayes for probabilistic model and back propagation algorithm were evaluated, and the results are compared and proved in an efficient manner. They even exploited various data sets of dissimilar entities which are used to measure the strength of association between words and co-occurrence statistics are also computed from this computation.

Sunday, 1 January 2017

Realizing Omni Directional Architectural Scalability with Software Stability

Vol. 11  Issue 1
Year:2016
Issue:Jul-Sep 
Title:Realizing Omni Directional Architectural Scalability with Software Stability
Author Name:M.E. Fayad, Shivanshu K. Singh and Rafael Capilla
Synopsis:
Current software development approaches need to cope with new design challenges, in which the incessant complexity of software system require more scalable systems that can be adapted better. Hence, the evolution of such systems and their architectures depend on how stable a design is against new requirements and on the desired quality level. As in previous columns, Software Stability results in a key to deal with many challenges that might influence the system. We have seen in previous articles in this series, what the problems associated with traditional software architecture approaches are, when it comes to scalability and stability in particular and how they negatively impact the software, over due course of time. Modern software development approaches require one to produce highly scalable, adaptable and stable systems and platforms, that in many cases could be more reactive against changes (e.g.: Self-adaptable systems). Thus, the underlying architecture behind such systems should be flexible enough and adaptable to realize the idea of stability.