Most of today’s techniques for data mining and association rule mining (ARM) in particular, are really “flat file mining”, since the database is typically dumped to an intermediate flat file that is input to the mining software. Previous research in integrating ARM with databases mainly looked at exploiting language (SQL) as a tool for implementing mining algorithms. In this paper we explore an...

In this article, we present a novel method for synthesizing quantum circuits from user-supplied components. Given input-output state vectors and component gates, our synthesizer aims to construct circuit that implements the provided functionality in terms of supplied gates. To achieve this, basically use an enumerative search with pruning. accelerate procedure, however, perform pruning at modul...

investigation of the interrelationships between yield and its components will improve the efficiency of a breeding program with appropriate selection criteria. in this study, the relationship among yield components and their direct and indirect influences on the total yield of melon were investigated. the study was based on evaluation of 49 entries gener-ated from a 7×7 diallel involving irania...

Convolutional Neural Networks (CNNs) are extensively used in image and video recognition, natural language processing and other machine learning applications. The success of CNNs in these areas corresponds with a significant increase in the number of parameters and computation costs. Recent approaches towards reducing these overheads involve pruning and compressing the weights of various layers...

The minimax algorithm, also called the negamax algorithm, remains today the most widely used search technique for two-player perfect-information games. However, minimaxing has been shown to be susceptible to game tree pathology, a paradoxical situation in which the accuracy of the search can decrease as the height of the tree increases. Althöfer’s alternative minimax algorithm has been proven t...

We present a framework for solving multistage pure 0–1 programs for a widely used sequencing and scheduling problem with uncertainty in the objective function coefficients, the constraint matrix and the right-hand side. The problem has the following form: given a set of operations to be executed along a time horizon, find a schedule to minimize a function included by the expected operations cos...

This paper presents techniques designed to minimise the number of states which are explored during subgraph isomorphism detection. A set of advanced topological node features, calculated from nneighbourhood graphs, is presented and shown to outperform existing features. Further, the pruning effectiveness of both the new and existing topological node features is significantly improved through th...

Mining large-scale text corpora is an essential step in extracting the key themes in a corpus. We motivate a quantitative measure for significant associations through the distributions of pairs and triplets of co-occurring words. We consider the algorithmic problem of efficiently enumerating such significant associations and present pruning algorithms for these problems, with theoretical as wel...