arXiv subjects

Wei-Chang Yeh

Publications and source records attributed to Wei-Chang Yeh.

39 records · Page 3Linked to original sources

arXiv2019

A Novel Generalized Artificial Neural Network for Mining Two-Class Datasets

A novel general neural network (GNN) is proposed for two-class data mining in this study. In a GNN, each attribute in the dataset is treated as a node, with each pair of nodes being connected by an arc. The reliability is of each arc, which is similar to the weight in artificial neural network and must be solved using simplified swarm optimization (SSO), is constant. After the node reliability is made the transformed value of the related attribute, the approximate reliability of each GNN instance is calculated based on the proposed intelligent Monte Carlo simulation (iMCS). This approximate GNN reliability is then compared with a given threshold to predict each instance. The proposed iMCS-SSO is used to repeat the procedure and train the GNN, such that the predicted class values match the actual class values as much as possible. To evaluate the classification performance of the proposed GNN, experiments were performed on five well-known benchmark datasets. The computational results compared favorably with those obtained using support vector machines.

cs.NE↗

arXiv2019

A new SSO-based Algorithm for the Bi-Objective Time-constrained task Scheduling Problem in Cloud Computing Services

Cloud computing distributes computing tasks across numerous distributed resources for large-scale calculation. The task scheduling problem is a long-standing problem in cloud-computing services with the purpose of determining the quality, availability, reliability, and ability of the cloud computing. This paper is an extension and a correction to our previous conference paper entitled Multi Objective Scheduling in Cloud Computing Using MOSSO published in 2018 IEEE Congress on Evolutionary Computation. More new algorithms, testing, and comparisons have been implemented to solve the bi-objective time-constrained task scheduling problem in a more efficient manner. Furthermore, this paper developed a new SSO-based algorithm called the bi-objective simplified swarm optimization to fix the error in previous SSO-based algorithm to address the task-scheduling problem. From the results obtained from the new experiments conducted, the proposed BSSO outperforms existing famous algorithms, e.g., NSGA-II, MOPSO, and MOSSO in the convergence, diversity, number of obtained temporary nondominated solutions, and the number of obtained real nondominated solutions. The results propound that the proposed BSSO can successfully achieve the aim of this work.

cs.DC↗

arXiv2019

A Simple Proof for the Four-Color Theorem

The four-color theorem states that no more than four colors are required to color all nodes in planar graphs such that no two adjacent nodes are of the same color. The theorem was first propounded by Francis Guthrie in 1852. Since then, scholars have either failed to solve this theorem or required computer assistance to prove it. Hence, the goal of this paper is to provide the first correct proof of this 170-year-old mathematical problem composed with the human brain and without computer assistance in only five pages.

math.GM↗