cover
Contact Name
-
Contact Email
-
Phone
-
Journal Mail Official
-
Editorial Address
-
Location
Kota yogyakarta,
Daerah istimewa yogyakarta
INDONESIA
Indonesian Journal of Electrical Engineering and Computer Science
ISSN : 25024752     EISSN : 25024760     DOI : -
Core Subject :
Arjuna Subject : -
Articles 9,226 Documents
Sentiment classification of social media reviews using an ensemble classifier Savita Sangam; Subhash Shinde
Indonesian Journal of Electrical Engineering and Computer Science Vol 16, No 1: October 2019
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v16.i1.pp355-363

Abstract

These days it has become a common practice for business organizations and individuals to make use of social media for sharing the opinions about the products or the services.  Consumers are also ready to share their views on certain products or commodities.  Thus huge amount of unstructured social media data gets generated day by day. Gradually heap of text data will be formed in many areas like automated business, education, health care, and show business and so on. Opinion mining also referred as sentiment analysis or sentiment classification, deals with mining of the review text and classifying the opinions or the sentiments of that text as positive or negative. In this paper we propose an ensemble classifier model consisting of Support Vector Machine and Artificial Neural Network. It combines the knowledge from two feature sets for sentiment classification. The proposed model shows the acceptable performance in terms of accuracy when compared with the baseline model.
Using the Object Mapping Approach from Analysis to Implementation for Developing Student Registration System Dhafer AbdulAmeer AbdulMonim; zainab hassan Muhamad; Bashar Alathari
Indonesian Journal of Electrical Engineering and Computer Science Vol 14, No 2: May 2019
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v14.i2.pp1030-1038

Abstract

The Unified Modeling Language (UML) is the effective standard language of an object-oriented based system analysis and design. The using of object-oriented approach based on UML specification can offer an understandable model, which can reduce the system's complexity. The use-case diagram, class diagram and sequence diagram are important models of the system development during early stages. The object mapping approach between UML class diagram in the analysis phase and source code in the implementation phase is a significant process in the software development life cycle. In order to ensure the consistency of system requirements from analysis to implementation. This paper presents the student registration system by using object mapping based on UML. The UML specification and the generation of Java source code influenced by specific features of class in object-oriented such as inheritance and the association between the classes.
A Comparative Study of Phase Offset Disposition Sinusoidal Pulse Width Modulation (POD-SPWM) and Symmetrical Pulse Width Modulation Switching Techiques for Generalized Current Source Multilevel Inverter(MCSI) Nik Fasdi Nik Ismail; Nasrudin Abdul Rahim; Siti Rohani Sheikh Raihan; Yusuf Al-Turki
Indonesian Journal of Electrical Engineering and Computer Science Vol 9, No 2: February 2018
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v9.i2.pp395-402

Abstract

This paper presents a comparison between two switching techniques namely Phase Offset Disposition Sinusoidal PWM (POD-SPWM) and Symmetrical PWM switching for a generalized current source multilevel inverter (MCSI) topology. One of the advantages of MCSI is it can reduce the total harmonic distortion (THD) at the output load current with a sinusoidal current waveform. In this paper, the generalized MCSI with the different levels has been developed with Matlab@simulation software in order to study the performance of the two switching schemes for the operation of the MCSI. From the simulation results, POD-SPWM switching technique can give better THD results compare to symmetrical switching technique.
Identification of mobile vehicle through multilayer intercommunication Ranjan Goyal; Anuradha Gnanaprakasam; Paritosh Pal Singh
Indonesian Journal of Electrical Engineering and Computer Science Vol 17, No 3: March 2020
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v17.i3.pp1390-1398

Abstract

In the recent times of data transmission, applying the Internet of Things (IoT) device, networking to the various IoT modules is still a great challenge with the deployment stage. Very few localities in the world have the deployed IoT module integrated in its communication, but still maximum of the location are in testbed. As a practical application, the IoT modules can be used to collect the information about either the drunken person who is driving the vehicle or the heavily loaded vehicles. The vehicle that we are about to search should be integrated with the IoT module. In this paper, a novel approach for object tracking specifically the drunken driving person and the heavily loaded vehicle is proposed to ensure the follow of rules and prevent any mis happening. The task is to identify the exact vehicle which does not follow the rules which can be tracked and eliminated. For that we are proposing a simple methodology on identifying the vehicle by the tracking the locality of the vehicle as a cluster of nodes where the cluster provides the key inference on how the vehicles are interrelated in the learning environment.
Optimized Ant Colony Algorithm by Local Pheromone Update Hui Yu
Indonesian Journal of Electrical Engineering and Computer Science Vol 12, No 2: February 2014
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Ant colony algorithm, a heuristic simulated algorithm, provides better solutions for non-convex, non-linear and discontinuous optimization problems. For ant colony algorithm, it is frequently to be trapped into local optimum, which might lead to stagnation. This article presents the  city-select strategy, local pheromone update strategy, optimum solution prediction strategy and local optimization strategy to optimize ant colony algorithm, provides ant colony algorithm based on local pheromone update,  also inspects and verifies it by TSP problems. The results of the numeric experiments suggest that on some TSP problems, the optimized ant colony algorithm acquired more satisfied solutions than all that we have already known.  DOI : http://dx.doi.org/10.11591/telkomnika.v12i2.4211 
One Kind of Routing Algorithm Modified in Wireless Sensor Network Nini Wei; Yi Song
Indonesian Journal of Electrical Engineering and Computer Science Vol 12, No 10: October 2014
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v12.i10.pp7495-7500

Abstract

The wireless sensor networks are the emerging next generation sensor networks, Routing technology is the wireless sensor network communication layer of the core technology. To build reliable paths in wireless sensor networks, we can consider two ways: providing multiple paths utilizing the redundancy to assure the communication reliability or constructing transmission reliability mechanism to assure the reliability of every hop. Braid multipath algorithm and ReInforM routing algorithm are the realizations of these two mechanisms. After the analysis of these two algorithms, this paper proposes a ReInforM routing algorithm based braid multipath routing algorithm.
A New Hybrid Particle Swarm Optimization and Greedy for 0-1 Knapsack Problem Phuong Hoai Nguyen; Dong Wang; Tung Khac Truong
Indonesian Journal of Electrical Engineering and Computer Science Vol 1, No 3: March 2016
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v1.i3.pp411-418

Abstract

This paper proposes a new binary particle swarm optimization with a greedy strategy to solve 0-1 knapsack problem. Two constraint handling techniques are consider to cooperation with binary particle swarm optimization that are penalty function and greedy. The sigmoid transfer function is used to convert real code to binary code. The experimental results have proven the superior performance of the proposed algorithm.
The Performance Analysis for Embedded Systems using Statistics Methods Wang Luyan; Shen Zhangguo; Chen Long
Indonesian Journal of Electrical Engineering and Computer Science Vol 11, No 7: July 2013
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Performance comparison for the computer system under different hardware platform & system structure is of vital importance in the study of the performance evaluation. The Performance Analysis for Embedded Systems by using statistics methods based on the randomized complete block designs was proposed. Using the randomized block design, the differences between conditions can be separated from the difference in the processing, and be separated from the experimental bias. A case study of automatic gate machines used in the automatic fare collection system of Shanghai Metro is presented. The obtained assessment results show that our approach is helpful and effective. DOI: http://dx.doi.org/10.11591/telkomnika.v11i7.2864 
Modelling of Time Efficiency in Heterogeneous and Adhoc Networks Yatendra Singh Bhandari; Yashwant Singh Chauhan; Priti Dimri
Indonesian Journal of Electrical Engineering and Computer Science Vol 12, No 1: October 2018
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v12.i1.pp147-154

Abstract

Heterogeneous Networks are bunch of homogeneous networks base stations grouped together. The term introduced in this research paper Time Efficiency (Te) gives out the information on the heterogeneous networks where most of the data flows in and out. In this paper, a model for evaluating Time Efficiency in heterogeneous network is developed. The common goals of different base stations in a heterogeneous network are towards coverage of area and capability improvement. Base stations in a homogeneous network differs in transmitted power, achievable rate of data, area covered, density of a base station, energy efficiency and time efficiency. To find out the area of most data flow in certain period, Time efficiency can be used as a major factor. 
Classification Algorithm for Gene Expression Graph and Manhattan Distance N Sevugapandi; C.P. Chandran
Indonesian Journal of Electrical Engineering and Computer Science Vol 5, No 2: February 2017
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v5.i2.pp472-478

Abstract

This proposed method focus on these issues by developing a novel classification algorithm by combining Gene Expression Graph (GEG) with Manhattan distance. This method will be used to express the gene expression data. Gene Expression Graph provides the optimal view about the relationship between normal and unhealthy genes. The method of using a graph-based gene expression to express gene information was first offered by the authors in [1] and [2], It will permits to construct a classifier based on an association between graphs represented for well-known classes and graphs represented for samples to evaluate. Additionally Euclidean distance is used to measure the strength of relationship which exists between the genes.

Filter by Year

2012 2026


Filter By Issues
All Issue Vol 42, No 1: April 2026 Vol 41, No 3: March 2026 Vol 41, No 2: February 2026 Vol 41, No 1: January 2026 Vol 40, No 3: December 2025 Vol 40, No 2: November 2025 Vol 40, No 1: October 2025 Vol 39, No 3: September 2025 Vol 39, No 2: August 2025 Vol 39, No 1: July 2025 Vol 38, No 3: June 2025 Vol 38, No 2: May 2025 Vol 38, No 1: April 2025 Vol 37, No 3: March 2025 Vol 37, No 2: February 2025 Vol 37, No 1: January 2025 Vol 36, No 3: December 2024 Vol 36, No 2: November 2024 Vol 36, No 1: October 2024 Vol 35, No 3: September 2024 Vol 35, No 2: August 2024 Vol 35, No 1: July 2024 Vol 34, No 3: June 2024 Vol 34, No 2: May 2024 Vol 34, No 1: April 2024 Vol 33, No 3: March 2024 Vol 33, No 2: February 2024 Vol 33, No 1: January 2024 Vol 32, No 3: December 2023 Vol 32, No 1: October 2023 Vol 31, No 3: September 2023 Vol 31, No 2: August 2023 Vol 31, No 1: July 2023 Vol 30, No 3: June 2023 Vol 30, No 2: May 2023 Vol 30, No 1: April 2023 Vol 29, No 3: March 2023 Vol 29, No 2: February 2023 Vol 29, No 1: January 2023 Vol 28, No 3: December 2022 Vol 28, No 2: November 2022 Vol 28, No 1: October 2022 Vol 27, No 3: September 2022 Vol 27, No 2: August 2022 Vol 27, No 1: July 2022 Vol 26, No 3: June 2022 Vol 26, No 2: May 2022 Vol 26, No 1: April 2022 Vol 25, No 3: March 2022 Vol 25, No 2: February 2022 Vol 25, No 1: January 2022 Vol 24, No 3: December 2021 Vol 24, No 2: November 2021 Vol 24, No 1: October 2021 Vol 23, No 3: September 2021 Vol 23, No 2: August 2021 Vol 23, No 1: July 2021 Vol 22, No 3: June 2021 Vol 22, No 2: May 2021 Vol 22, No 1: April 2021 Vol 21, No 3: March 2021 Vol 21, No 2: February 2021 Vol 21, No 1: January 2021 Vol 20, No 3: December 2020 Vol 20, No 2: November 2020 Vol 20, No 1: October 2020 Vol 19, No 3: September 2020 Vol 19, No 2: August 2020 Vol 19, No 1: July 2020 Vol 18, No 3: June 2020 Vol 18, No 2: May 2020 Vol 18, No 1: April 2020 Vol 17, No 3: March 2020 Vol 17, No 2: February 2020 Vol 17, No 1: January 2020 Vol 16, No 3: December 2019 Vol 16, No 2: November 2019 Vol 16, No 1: October 2019 Vol 15, No 3: September 2019 Vol 15, No 2: August 2019 Vol 15, No 1: July 2019 Vol 14, No 3: June 2019 Vol 14, No 2: May 2019 Vol 14, No 1: April 2019 Vol 13, No 3: March 2019 Vol 13, No 2: February 2019 Vol 13, No 1: January 2019 Vol 12, No 3: December 2018 Vol 12, No 2: November 2018 Vol 12, No 1: October 2018 Vol 11, No 3: September 2018 Vol 11, No 2: August 2018 Vol 11, No 1: July 2018 Vol 10, No 3: June 2018 Vol 10, No 2: May 2018 Vol 10, No 1: April 2018 Vol 9, No 3: March 2018 Vol 9, No 2: February 2018 Vol 9, No 1: January 2018 Vol 8, No 3: December 2017 Vol 8, No 2: November 2017 Vol 8, No 1: October 2017 Vol 7, No 3: September 2017 Vol 7, No 2: August 2017 Vol 7, No 1: July 2017 Vol 6, No 3: June 2017 Vol 6, No 2: May 2017 Vol 6, No 1: April 2017 Vol 5, No 3: March 2017 Vol 5, No 2: February 2017 Vol 5, No 1: January 2017 Vol 4, No 3: December 2016 Vol 4, No 2: November 2016 Vol 4, No 1: October 2016 Vol 3, No 3: September 2016 Vol 3, No 2: August 2016 Vol 3, No 1: July 2016 Vol 2, No 3: June 2016 Vol 2, No 2: May 2016 Vol 2, No 1: April 2016 Vol 1, No 3: March 2016 Vol 1, No 2: February 2016 Vol 1, No 1: January 2016 Vol 16, No 3: December 2015 Vol 16, No 2: November 2015 Vol 16, No 1: October 2015 Vol 15, No 3: September 2015 Vol 15, No 2: August 2015 Vol 15, No 1: July 2015 Vol 14, No 3: June 2015 Vol 14, No 2: May 2015 Vol 14, No 1: April 2015 Vol 13, No 3: March 2015 Vol 13, No 2: February 2015 Vol 13, No 1: January 2015 Vol 12, No 12: December 2014 Vol 12, No 11: November 2014 Vol 12, No 10: October 2014 Vol 12, No 9: September 2014 Vol 12, No 8: August 2014 Vol 12, No 7: July 2014 Vol 12, No 6: June 2014 Vol 12, No 5: May 2014 Vol 12, No 4: April 2014 Vol 12, No 3: March 2014 Vol 12, No 2: February 2014 Vol 12, No 1: January 2014 Vol 11, No 12: December 2013 Vol 11, No 11: November 2013 Vol 11, No 10: October 2013 Vol 11, No 9: September 2013 Vol 11, No 8: August 2013 Vol 11, No 7: July 2013 Vol 11, No 6: June 2013 Vol 11, No 5: May 2013 Vol 11, No 4: April 2013 Vol 11, No 3: March 2013 Vol 11, No 2: February 2013 Vol 11, No 1: January 2013 Vol 10, No 8: December 2012 Vol 10, No 7: November 2012 Vol 10, No 6: October 2012 Vol 10, No 5: September 2012 Vol 10, No 4: August 2012 Vol 10, No 3: July 2012 More Issue