Peeling Algorithm on Random Hypergraphs with Superlinear Number of Hyperedges.
Ryuhei MoriOsamu WatanabePublished in: CoRR (2015)
Keyphrases
- computational complexity
- learning algorithm
- preprocessing
- computational effort
- randomly generated
- experimental evaluation
- improved algorithm
- optimization algorithm
- detection algorithm
- k means
- significant improvement
- probabilistic model
- np hard
- clustering method
- ant colony optimization
- worst case
- dynamic programming
- cost function
- times faster
- high accuracy
- matching algorithm
- undirected graph
- initial set
- execution times
- single scan
- theoretical analysis
- small number
- optimal solution
- objective function
- similarity measure
- expectation maximization
- input data
- classification algorithm
- simulated annealing
- computational cost
- multi objective
- search space
- search algorithm