Effective pruning is essential for efficient iceberg cube computation. Previous studies have focused on exclusive pruning: regions of a search space that do not satisfy some condition are excluded from computation. In this paper we propose inclusive and anti-pruning. With inclusive pruning, necessary conditions that solutions must satisfy are identified and regions that can not be reached by su...

After development of the theory in the part I paper, systems of up to 300 nonlinear equations are solved in this paper by the Levenberg-Marquardt optimization algorithm. The maximum load is reached when the circumferential cracks begin to form. Numerical calculations show a typical quasi brittle size effect such that the plot of log CYN versus log h (where CXN = nominal stress at maximum load a...

Dots-And-Boxes is a well-known and widely-played combinatorial game. While the rules of play are very simple, the state space for even very small games is extremely large, and finding the outcome under optimal play is correspondingly hard. In this paper we introduce a Dots-And-Boxes solver which is significantly faster than the current state-of-the-art: over an order-of-magnitude faster on seve...

In this work we investigate several issues in order to improve the performance of probabilistic estimation trees (PETs). First, we derive a new probability smoothing that takes into account the class distributions of all the nodes from the root to each leaf. Secondly, we introduce or adapt some new splitting criteria aimed at improving probability estimates rather than improving classification ...

Internet Traffic classification is vital for various network activities such as detection of malware. Security is major issue of concern which accounts for the reputation and reliability of system. Malware effects the system adversely results in data loss or abnormal functioning. Hence, detection and as well as removal of malware is crucial. Combining set of classifiers called as ensembling pro...

We describe an experimental study of pruning methods for decision tree classiiers when the goal is minimizing loss rather than error. In addition to two common methods for error minimization, CART's cost-complexity pruning and C4.5's error-based pruning, we study the extension of cost-complexity pruning to loss and one pruning variant based on the Laplace correction. We perform an empirical com...

Pruning of structural synapses occurs with development and learning. A deficit in pruning of cortical excitatory synapses and the resulting hyperconnectivity is hypothesized to underlie the etiology of fragile X syndrome (FXS) and related autistic disorders. However, clear evidence for pruning in neocortex and its impairment in FXS remains elusive. Using simultaneous recordings of pyramidal neu...