cover
Article Per Year (5 Year)
All
Home Page
OAI Link
Editorial Team
Contact
Reviewer
Google Scholar
Contact Name
Siti Nurmaini
Contact Email
comengappjournal@unsri.ac.id
Phone
+6285268048092
Journal Mail Official
comengappjournal@unsri.ac.id
Editorial Address
Jurusan Sistem Komputer, Fakultas Ilmu Komputer, Universtas Sriwijaya, KampusUnsri Bukit Besar, Palembang
Location
Kab. ogan ilir,
Sumatera selatan
INDONESIA
ComEngApp : Computer Engineering and Applications Journal
Published by Universitas Sriwijaya
ISSN : 22524274     EISSN : 22525459     DOI : 10.18495
Core Subject : Science, Engineering,
Computer Science & IT Engineering
ComEngApp-Journal (Collaboration between University of Sriwijaya, Kirklareli University and IAES) is an international forum for scientists and engineers involved in all aspects of computer engineering and technology to publish high quality and refereed papers. This Journal is an open access journal that provides online publication (three times a year) of articles in all areas of the subject in computer engineering and application. ComEngApp-Journal wishes to provide good chances for academic and industry professionals to discuss recent progress in various areas of computer science and computer engineering.
Arjuna Subject : Teknik (semua kategori) - Teknik (Lain-Lain)
Articles 6 Documents
 1 
Search results for , issue "Vol 2 No 3 (2013)" : 6 Documents clear
E-mail spam filtering by a new hybrid feature selection method using IG and CNB wrapper Seyed Mostafa Pourhashemi
Computer Engineering and Applications Journal Vol 2 No 3 (2013)
Publisher : Universitas Sriwijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (15.968 KB) | DOI: 10.18495/comengapp.v2i3.29

Abstract

The growing volume of spam emails has resulted in the necessity for more accurate and efficient email classification system. The purpose of this research is presenting an machine learning approach for enhancing the accuracy of automatic spam detecting and filtering and separating them from legitimate messages. In this regard, for reducing the error rate and increasing the efficiency, the hybrid architecture on feature selection has been used. Features used in these systems, are the body of text messages. Proposed system of this research has used the combination of two filtering models, Filter and Wrapper, with Information Gain (IG) filter and Complement Naïve Bayes (CNB) wrapper as feature selectors. In addition, Multinomial Naïve Bayes (MNB) classifier, Discriminative Multinomial Naïve Bayes (DMNB) classifier, Support Vector Machine (SVM) classifier and Random Forest classifier are used for classification. Finally, the output results of this classifiers and feature selection methods are examined and the best design is selected and it is compared with another similar works by considering different parameters. The optimal accuracy of the proposed system is evaluated equal to 99%.
Two phase privacy preserving data mining Pooja Gupta; Ashish Kumar
Computer Engineering and Applications Journal Vol 2 No 3 (2013)
Publisher : Universitas Sriwijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (1161.757 KB) | DOI: 10.18495/comengapp.v2i3.30

Abstract

The paper proposes a framework to improve the privacy preserving data mining. The approach adopted provides security at both the ends i.e. at the data transmission time as well as in the data mining process using two phases. The secure data transmission is handled using elliptic curve cryptography (ECC) and the privacy is preserved using k-anonymity. The proposed framework ensures highly secure environment. We observed that the framework outperforms other approaches [8] discussed in the literature at both ends i.e. at security and privacy of data. Since most of the approaches have considered either secure transmission or privacy preserving data mining but very few have considered both. We have used WEKA 3.6.9 for experimentation and analysis of our approach. We have also analyzed the case of k-anonymity when the numbers of records in a group are less than k (hiding factor) by inserting fake records. The obtained results have shown the pattern that the insertion of fake records leads to more accuracy as compared to full suppression of records. Since, full suppression may hide important information in cases where records are less than k, on the other hand in the process of fake records insertion; records are available even if number of records in a group is less than k.
Design Concept of Convexity Defect Method on Hand Gestures as Password Door Lock Rossi Passarella; Muhammad Fadli; Sutarno Sutarno
Computer Engineering and Applications Journal Vol 2 No 3 (2013)
Publisher : Universitas Sriwijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (1183.912 KB) | DOI: 10.18495/comengapp.v2i3.32

Abstract

In this paper we purpose a several steps to implement security for locking door by using hand gestures as password. The methods considered as preprocessing image, skin detection and Convexity Defection. The main components of the system are Camera, Personal Computer (PC), Microcontroller and Motor (Lock). Bluetooth communication are applied to communicate between PC and microcontroller to open and lock door used commands character such as “O” and “C”. The results of this system show that the hand gestures can be measured, identified and quantified consistently.
Human Perception Based Color Image Segmentation Neeta Pradeep Gargote; Savitha Devaraj; Shravani Shahapure
Computer Engineering and Applications Journal Vol 2 No 3 (2013)
Publisher : Universitas Sriwijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (1192.109 KB) | DOI: 10.18495/comengapp.v2i3.34

Abstract

Color image segmentation is probably the most important task in image analysis and understanding. A novel Human Perception Based Color Image Segmentation System is presented in this paper. This system uses a neural network architecture. The neurons here uses a multisigmoid activation function. The multisigmoid activation function is the key for segmentation. The number of steps ie. thresholds in the multisigmoid function are dependent on the number of clusters in the image. The threshold values for detecting the clusters and their labels are found automatically from the first order derivative of histograms of saturation and intensity in the HSI color space. Here the main use of neural network is to detect the number of objects automatically from an image. It labels the objects with their mean colors. The algorithm is found to be reliable and works satisfactorily on different kinds of color images.
Improvement and Comparison of Mean Shift Tracker using Convex Kernel Function and Motion Information S. B. Chaudhari; K. K. Warhade; V. M. Wadhai; N. N. Choudhari
Computer Engineering and Applications Journal Vol 2 No 3 (2013)
Publisher : Universitas Sriwijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (1185.342 KB) | DOI: 10.18495/comengapp.v2i3.35

Abstract

Any tracking algorithm must be able to detect interested moving objects in its field of view and then track it from frame to frame. The tracking algorithms based on mean shift are robust and efficient. But they have limitations like inaccuracy of target localization, object being tracked must not pass by another object with similar features i.e. occlusion and fast object motion. This paper proposes and compares an improved adaptive mean shift algorithm and adaptive mean shift using a convex kernel function through motion information. Experimental results show that both methods track the object without tracking errors. Adaptive method gives less computation cost and proper target localization and Mean shift using convex kernel function shows good results for the tracking challenges like partial occlusion and fast object motion faced by basic Mean shift algorithm.
How Networking Empirically Influences the Types of Innovation?: Pardis Technology Park as a Case Study Amir Mirzadeh Phirouzabadi; M Mahmoudian; M Asghari
Computer Engineering and Applications Journal Vol 2 No 3 (2013)
Publisher : Universitas Sriwijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (1186.454 KB) | DOI: 10.18495/comengapp.v2i3.36

Abstract

Nowadays, Innovation can be named as one of the best practices as quality, speed, dependability, flexibility and cost which it helps organization enter to new markets, increase the existing market share and provide it with a competitive edge. In addition, organizations have moved forward from “hiding idea (Closed Innovation)” to “opening them (Open Innovation)”. Therefore, concepts such as “open innovation” and “innovation network” have become important and beneficial to both academic and market society. Therefore, this study tried to empirically study the effects of networking on innovations. In this regard, in order to empirically explore how networking influences innovations, this paper used types of innovations based on OCED definition as organizational, marketing, process and product and compared their changes before and after networking of 45 companies in the network Pardis Technology Park as a case study. The results and findings showed that all of the innovation types were increased after jointing the companies to the network. In fact, we arranged these changing proportions from the most to the least change as marketing, process, organizational and product innovation respectively. Although there were some negative growth in some measures of these innovations after jointing into the network.

Page 1 of 1 | Total Record : 6

 1 

Filter by Year

2013 2013


Reset
Filter By Issues
All Issue Vol. 14 No. 2 (2025) Vol 14 No 1 (2025) Vol. 14 No. 1 (2025) Vol 13 No 03 (2024) Vol. 13 No. 3 (2024) Vol. 13 No. 2 (2024) Vol 13 No 2 (2024) Vol 13 No 1 (2024) Vol. 13 No. 1 (2024) Vol 12 No 3 (2023) Vol. 12 No. 3 (2023) Vol. 12 No. 2 (2023) Vol 12 No 2 (2023) Vol. 12 No. 1 (2023) Vol 12 No 1 (2023) Vol 11 No 3 (2022) Vol. 11 No. 3 (2022) Vol. 11 No. 2 (2022) Vol 11 No 2 (2022) Vol 11 No 1 (2022) Vol. 11 No. 1 (2022) Vol 10 No 3 (2021) Vol 10 No 2 (2021) Vol 10 No 1 (2021) Vol 9 No 3 (2020) Vol 9 No 2 (2020) Vol 9 No 1 (2020) Vol 8 No 3 (2019) Vol 8 No 2 (2019) Vol 8 No 1 (2019) Vol 7 No 3 (2018) Vol 7 No 2 (2018) Vol 7 No 1 (2018) Vol 6 No 3 (2017) Vol 6 No 2 (2017) Vol. 6 No. 2 (2017) Vol. 6 No. 1 (2017) Vol 6 No 1 (2017) Vol. 5 No. 3 (2016) Vol 5 No 3 (2016) Vol 5 No 2 (2016) Vol 5 No 1 (2016) Vol 4 No 3 (2015) Vol 4 No 2 (2015) Vol 4 No 1 (2015) Vol 3 No 3 (2014) Vol 3 No 2 (2014) Vol 3 No 1 (2014) Vol 2 No 3 (2013) Vol. 2 No. 3 (2013) Vol. 2 No. 2 (2013) Vol 2 No 2 (2013) Vol. 2 No. 1 (2013) Vol 2 No 1 (2013) Vol 1 No 2 (2012) Vol. 1 No. 2 (2012) Vol 1 No 1 (2012) More Issue