Journal of Computer Sciences and Applications

Regression is the data mining process related to estimating a value for a given input by modeling the relationship between the predicators and the response. Choosing the most suitable regression algorithm is the center of big discussion in which the dataset always having the final decision. But when we studied different numerical datasets, we noticed that, data repetition over different intervals is a common property that could be found between any pair of attribute and class values. To exploit this property, this paper begins the journey of finding a new regression approach to address all numeric datasets. The new method uses the minimum bounding geometry to bound the data points in shapes which are used later to suggest values. From the suggested values we choose our targeted prediction value. When we tried this method on different datasets even with the circle as the bounding shape, the results were not perfect but encouraging enough to further elaborate the method. Besides that, the method showed a possibility to do other data mining tasks.

Journal of Computer Sciences and Applications. 2014, 2(2), 36-39. DOI: 10.12691/jcsa-2-2-4
Pub. Date: December 09, 2014

Full-Text PDF

12139 Views3394 Downloads46 Likes

Evaluating Query Execution Plans by Implementing Join Operators using Particle Swarm Optimization

by Sambit Kumar Mishra, Srikanta Pattnaik and Dulu Patnaik

Original Research

The nested structured queries as well as nested iteration as operator in both the logical and physical query algebra have been sometimes neglected in research. Interesting issues arise if multiple invocations of the same nested computation affect each other, e.g., the first invocation warms up the I/O buffer for subsequent ones. Other interesting issues arise if different nested computations compete for resources, e.g., I/O buffer or memory for sort and hash operations within inner queries. Nested computations are very important in practice, both because queries are authored using nested structured queries and because nested iteration based on index-to-index navigation often is the best execution plan. Therefore, nested computations could be a very fruitful research topic, both execution and optimization, and could probably also benefit from more dynamic and adaptive techniques than those in use today. While most resource issues have relatively little impact on optimal plan choices (even if they affect the ranking among different plans of fairly similar costs), one issue that is crucial in practice but usually ignored in academic research is the effect of buffer hits and faults in complex query plans. However, a conceptual model may be needed of nested queries that are substantially simpler, e.g., based on algebra expressions with a table of parameter values. In this paper it is aimed to find location of local minima of particle, random velocities of particles considering the relation schemes. The query plans related to relation schemes may be represented as particles. The query is optimized at compile time by that the complete query execution plans may be generated. The function evaluation of particles represented in terms of query plans in the relation schemes is planned to be done by considering random population of continuous values and velocities.

Journal of Computer Sciences and Applications. 2014, 2(2), 31-35. DOI: 10.12691/jcsa-2-2-3
Pub. Date: September 18, 2014

Full-Text PDF

19816 Views6548 Downloads37 Likes

Using an Evolutionary Heuristics for Solving the Outdoor Advertising Optimization Problem

by Zheldak T.A. and Redko V.

Original Research

In this paper we consider the problem of selecting a carrier of the plurality of outdoor advertising offers available in the formulation of the knapsack problem, namely, when restricted to the amount of funding. The paper proposes a variant of the heuristic based on the modeling method of artificial immune system of the human body. The basis algorithm immune operators comprise cloning, mutation, selective compression of the memory and repeating the natural processes in lymphocytes. The proposed simulation method of artificial immune systems can be used to solve a wide range of combinatorial search and constrained optimization problems.

Journal of Computer Sciences and Applications. 2014, 2(2), 23-30. DOI: 10.12691/jcsa-2-2-2
Pub. Date: September 04, 2014

Full-Text PDF

17460 Views5942 Downloads36 Likes

Network Performance Evaluation Based on Three Processes

by Karima Velásquez and Eric Gamess

Original Research

Network performance evaluation has traditionally been done following the client/server model, using two processes to carry out the evaluation. In this paper we present a different approach. We propose an enhancement to the classical performance evaluation by using three processes: client, server, and a middle process that reports additional gauges which allow users to more accurately and rapidly detect network anomalies. For this third process we wrote two versions: one for PC-based routers, and the other for off-the-shelf wireless routers. The former version was presented in one of our previous works. In this paper, we present our experience in writing and porting our application to wireless routers. Additionally, we perform different experiments to validate the correctness of the results reported. Furthermore, we present additional experiments that illustrate another possible uses for our tool.

Journal of Computer Sciences and Applications. 2014, 2(2), 14-22. DOI: 10.12691/jcsa-2-2-1
Pub. Date: May 27, 2014

Full-Text PDF

25421 Views10935 Downloads35 Likes