An Algorithm for Reading Dependencies from the Minimal Undirected Independence Map of a Graphoid that Satisfies Weak Transitivity.
José M. PeñaRoland NilssonJohan BjörkegrenJesper TegnérPublished in: J. Mach. Learn. Res. (2009)
Keyphrases
- dynamic programming
- learning algorithm
- high accuracy
- cost function
- improved algorithm
- expectation maximization
- detection algorithm
- classification algorithm
- neural network
- optimal solution
- significant improvement
- experimental evaluation
- times faster
- probabilistic model
- objective function
- similarity measure
- map estimation
- convex hull
- theoretical analysis
- computationally efficient
- dependency analysis
- random walk
- particle swarm optimization
- input data
- linear programming
- worst case
- computational cost
- np hard
- k means
- search space
- relational databases