FSSD - A Fast and Efficient Algorithm for Subgroup Set Discovery.
Adnene BelfodilAimene BelfodilAnes BendimeradPhilippe LamarreCéline RobardetMehdi KaytoueMarc PlantevitPublished in: DSAA (2019)
Keyphrases
- detection algorithm
- optimization algorithm
- single pass
- improved algorithm
- pruning strategy
- times faster
- preprocessing
- np hard
- high accuracy
- lower and upper bounds
- dynamic programming
- theoretical analysis
- expectation maximization
- solution space
- experimental evaluation
- computational complexity
- optimal solution
- recognition algorithm
- conflict free
- packing problem
- initial set
- decomposition algorithm
- data sets
- knowledge discovery
- computational cost
- k means
- objective function
- learning algorithm
- ant colony optimization
- tree structure
- computationally efficient
- convex hull
- input data
- probabilistic model
- search space
- data mining
- neural network