Search the World's Largest Database of Information Science & Technology Terms & Definitions
InfInfoScipedia LogoScipedia
A Free Service of IGI Global Publishing House
Below please find a list of definitions for the term that
you selected from multiple scholarly research resources.

What is Branch-and-Bound

Chapter 9
Emerging Technologies and Applications in Data Processing and Management
Branch-and-bound is an algorithm design paradigm for discrete and combinatorial optimization problems. The algorithm depends on efficient estimation of the lower and upper bounds of regions/branches of the search space.
Published in Chapter:
A Fuzzy RDF Graph-Matching Method Based on Neighborhood Similarity
Guanfeng Li (Ningxia University, China) and Zongmin Ma (Nanjing University of Aeronautics and Astronautics, China)
Copyright: © 2019 |Pages: 15
DOI: 10.4018/978-1-5225-8446-9.ch009
Abstract
With the popularity of fuzzy RDF data, identifying correspondences among these data sources is an important task. Although there are some solutions addressing this problem in classical RDF datasets, existing methods do not consider fuzzy information which is an important property existing in fuzzy RDF graphs. In this article, we apply fuzzy graph to model the fuzzy RDF datasets and propose a novel similarity-oriented RDF graph matching approach, which makes full use of the 1-hop neighbor vertex and edge label information, and takes into account the fuzzy information of a fuzzy RDF graph. Based on the neighborhood similarity, we propose a breadth-first branch-and-bound method for fuzzy RDF graph matching, which uses a state space search method and uses truncation parameters to constrain the search. This algorithm can be used to identify the matched pairs.
Full Text Chapter Download: US $37.50 Add to Cart
eContent Pro Discount Banner
InfoSci OnDemandECP Editorial ServicesAGOSR