Data Mining with optimized two-dimensional association rules
From MaRDI portal
Recommendations
Cited in
(27)- Mining optimized association rules for numeric attributes
- Mining for empty spaces in large data sets.
- Efficient algorithms for the maximum sum problems
- Independent set of convex polygons: from \(n^{\epsilon}\) to \(1+\epsilon \) via shrinking
- Fuzzy association rules and the extended mining algorithms
- Multi-objective genetic algorithm based approaches for mining optimized fuzzy association rules
- Weighted independent sets in classes of \(P_6\)-free graphs
- Effect of corner information in simultaneous placement of k rectangles and tableaux
- Coloring and maximum independent set of rectangles
- Maximum weight independent sets in classes related to claw-free graphs
- EFFICIENT ALGORITHMS FOR THE OPTIMAL-RATIO REGION DETECTION PROBLEMS IN DISCRETE GEOMETRY WITH APPLICATIONS
- On atomic structure of \(P_5\)-free subclasses and maximum weight independent set problem
- scientific article; zbMATH DE number 1748433 (Why is no real title available?)
- scientific article; zbMATH DE number 1897923 (Why is no real title available?)
- Space-time trade-offs for stack-based algorithms
- Linear time computation of the maximal linear and circular sums of multiple independent insertions into a sequence
- THE LAYERED NET SURFACE PROBLEMS IN DISCRETE GEOMETRY AND MEDICAL IMAGE SEGMENTATION
- Mining optimized support rules for numeric attributes
- Representing a functional curve by curves with fewer peaks
- An algorithm for the maximum weight independent set problem on outerstring graphs
- A data structure for the maximum-sum segment problem with offsets
- Approximating the maximum independent set of convex polygons with a bounded number of directions
- Parameterized approximation for maximum weight independent set of rectangles and segments
- An efficient algorithm for finding dense regions for mining quantitative association rules
- Weighted independent sets in a subclass of P₆-free graphs
- Algorithms for finding the weight-constrained \(k\) longest paths in a tree and the length-constrained \(k\) maximum-sum segments of a sequence
- Optimal algorithms for the average-constrained maximum-sum segment problem
This page was built for publication: Data Mining with optimized two-dimensional association rules
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3507285)
