Search results for "algorithm"
showing 10 items of 4887 documents
Datamining: Pemanfaatan Algoritma Apriori dalam Menganalisa Pola-Pola Transaksi yang Terjadi
2012
This paper will be described about implementation and analysis of the well-known apriori algorithm, which is called Market Basket Analysis (MBA) in data mining. This algorithm is widely used to predict the relation among market basket in the huge amount of database. This algorithm is based on the concept of a prefix tree. There are several ways to organize the nodes of such a tree, to encode the items, and to organize the transactions, which may be used in order to minimize the time needed to find the frequent itemsets as well as to reduce the amount of memory needed to store the counters. The rules produced will be used by management of supermarket to organize the items set to increase the…
Solution Using Clustering Methods
1987
The main aim of this analysis is to find out typical morphologies from the multivariate and longitudinal data set on growing children and to describe the morphological evolution of the found groups of girls. The finding out of typical morphologies is, in our opinion, strictly linked to the search of structures in the individuals and in the variables.
Forbidden Factors and Fragment Assembly
2002
In this paper we approach the fragment assembly problem by using the notion of minimal forbidden factors introduced in previous paper. Denoting by M(w) the set of minimal forbidden factors of a word w, we first focus on the evaluation of the size of elements in M(w) and on designing of an algorithm to recover the word w from M(w). Actually we prove that for a word w randomly generated by a memoryless source with identical symbol probabilities, the maximal length m(w) of words in M(w) is logarithmic and that the reconstruction algorithm runs in linear time. These results have an interesting application to the fragment assembly problem, i.e. reconstruct a word w from a given set I of substrin…
On the packing sums of pairs
1993
Abstract This paper is concerned with the determination of the length of the largest interval of consecutive integers of the set hA k , where A k is a sequence of integers which is a B h -sequence.
Algorithms for transforming an integral photography into a plenoptic picture
2013
We report a simple algorithm for transforming the set of elemental images captured with an integral-photography set up, into the set of micro-images ready to be projected into an integral-imaging monitor. The method is based in the transposing relation between an integral photography and a plenoptic picture. The reported technique permits to adapt the integral images to the resolution and size of the monitor.
Automating the Parameter Selection in VRP: An Off-line Parameter Tuning Tool Comparison
2014
Vehicle route optimization is an important application of combinatorial optimization. Therefore, a variety of methods has been proposed to solve different challenging vehicle routing problems. An important step in adopting these methods to solve real-life problems is to find appropriate parameters for the routing algorithms. In this chapter, we show how this task can be automated using parameter tuning by presenting a set of comparative experiments on seven state-of-the-art tuning methods. We analyze the suitability of these methods in configuring routing algorithms, and give the first critical comparison of automated parameter tuners in vehicle routing. Our experimental results show that t…
A computational study of several heuristics for the DRPP
1995
The problem of designing a route of minimum length for a postman that starts and finishes at his office and has to deliver the mail along a set of streets in a city is known as the Rural Postman Problem. When the postman has to obey the directions of the streets, we have the directed version of this problem. Finding an exact solution, in the general case, is intractably difficult. Hence, we have implemented three heuristic algorithms for approximately solving this problem and a procedure for obtaining a lower bound to the optimal length. Also, we present numerical experimentations based on a collection of random instances with up to 30 connected components, 240 vertices and 801 arcs. A lowe…
Closedness Properties in EX-Identification of Recursive Functions
1998
In this paper we investigate in which cases unions of identifiable classes of recursive functions are also necessarily identifiable. We consider identification in the limit with bounds on mindchanges and anomalies. Though not closed under the set union, these identification types still have features resembling closedness. For each of them we find such n that 1) if every union of n - 1 classes out of U1;, . . ., Un is identifiable, so is the union of all n classes; 2) there are such classes U1;, . . ., Un-1 that every union of n-2 classes out of them is identifiable, while the union of n - 1 classes is not. We show that by finding these n we can distinguish which requirements put on the iden…
The set of conjugacy class sizes of a finite group does not determine its solvability
2014
Abstract We find a pair of groups, one solvable and the other non-solvable, with the same set of conjugacy class sizes.
On WQO Property for Different Quasi Orderings of the Set of Permutations
2013
The property of certain sets being well quasi ordered (WQO) has several useful applications in computer science – it can be used to prove the existence of efficient algorithms and also in certain cases to prove that a specific algorithm terminates.