Restart and Random Walk in Local Search for Maximum Vertex Weight Cliques With Evaluations in Clustering Aggregation

doi 10.24963/ijcai.2017/87
Full Text
Abstract

Available in full text

Date
Authors
Publisher

International Joint Conferences on Artificial Intelligence Organization

Related search

How Randomized Search Heuristics Find Maximum Cliques in Planar Graphs

2006English

Scattering Quantum Random-Walk Search With Errors

Physical Review A
2007English

Random Walk-Based Recommendation With Restart Using Social Information and Bayesian Transition Matrices

International Journal of Computer Applications
2015English

Video Object Co-Segmentation by Regulated Maximum Weight Cliques

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

A Novel Target Convergence Set Based Random Walk With Restart for Prediction of Potential LncRNA-disease Associations

BMC Bioinformatics
BiochemistryApplied MathematicsComputer Science ApplicationsStructural BiologyMolecular Biology
2019English

The Distribution of the Maximum Vertex Degree in Random Planar Maps

Journal of Combinatorial Theory - Series A
CombinatoricsComputational TheoryDiscrete MathematicsTheoretical Computer ScienceMathematics
2000English

Directed Random Walk With Random Restarts: The Sisyphus Random Walk

Physical review. E
Nonlinear PhysicsProbabilityStatisticsCondensed Matter PhysicsStatistical
2016English

Local Search With Edge Weighting and Configuration Checking Heuristics for Minimum Vertex Cover

Artificial Intelligence
LinguisticsLanguageArtificial Intelligence
2011English

PUSH: A Generalized Operator for the Maximum Vertex Weight Clique Problem

European Journal of Operational Research
Information SystemsSimulationManagement ScienceManagementComputer ScienceModelingOperations Research
2017English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy