A cubic-time algorithm for computing the trinet distance between level-1 networks.
Vincent MoultonJames OldmanTaoyang WuPublished in: CoRR (2017)
Keyphrases
- preprocessing
- learning algorithm
- times faster
- matching algorithm
- detection algorithm
- optimization algorithm
- experimental evaluation
- computational complexity
- significant improvement
- cost function
- np hard
- hamming distance
- computational cost
- worst case
- expectation maximization
- objective function
- k means
- distance metric
- bayesian networks
- segmentation algorithm
- convergence rate
- improved algorithm
- dynamic programming
- recognition algorithm
- fully connected
- clustering method
- theoretical analysis
- input data
- multi objective
- optimal solution
- similarity measure
- social networks