As the need for strategic information is escalating at a tremendous rate worldwide, it has become a challenging task to manage the growing data and efficiently mine useful knowledge out of this raw data. Pattern Mining is one such technique to mine useful patterns out of the pattern warehouse. Patterns are the one way of knowledge representations. Few pattern generation and mining approaches ar...

  The clustering problem under the criterion of minimum sum of squares is a non-convex and non-linear program, which possesses many locally optimal values, resulting that its solution often falls into these trap and therefore cannot converge to global optima solution. In this paper, an efficient hybrid optimization algorithm is developed for solving this problem, called Tabu-KM. It gathers the ...

In this paper an integrated lot-sizing and scheduling problem in a flexible job shop environment with machine-capacity-constraint is studied. The main objective is to minimize the total cost which includes the inventory costs, production costs and the costs of machine’s idle times. First, a new mixed integer programming model,with small bucket time approach,based onProportional Lot sizing and S...

Several researchers have noted that human chess players do not perceive a position as a static entity, but as a collection of potential actions. Indeed, it looks as if human chess players are able to follow promising moves without considering all the alternatives. This work studies the possibility of incorporating such capabilities into chess programs. We present a methodology for representing ...

Nearest neighbour search is one of the most simple and used technique in Pattern Recognition. In this paper we are interested on tree based algorithms that only make use of the metric properties of the space. One of the most known and refereed method in this class was proposed by Fukunaga and Narendra in the 70’s. This algorithm uses a tree that is traversed on search time and uses some elimina...

Pattern Search Algorithms for Mixed Variable General Constrained Optimization Problems

This paper presents an approach to select the optimal reference subset (ORS) for nearest neighbor classi$er. The optimal reference subset, which has minimum sample size and satis$es a certain resubstitution error rate threshold, is obtained through a tabu search (TS) algorithm. When the error rate threshold is set to zero, the algorithm obtains a near minimal consistent subset of a given traini...

Periodic-frequent patterns are an important class of regularities that exist in a transactional database. Informally, a frequent pattern is said to be periodic-frequent if it appears at a regular interval specified by the user (i.e., periodically) in a database. A pattern-growth algorithm, called PFP-growth, has been proposed in the literature to discover the patterns. This algorithm constructs...