In this paper, we propose an algorithm called Neighborhood Matchmaker Method to optimize personal human networks. Personal human network is useful for various utilization of information like information gathering, but it is usually formed locally and often independently. In order to adapt various needs for information utilization, it is necessary to extend and optimize it. Using the neighborhood matchmaker method, we can increase a new friend who is expected to share interests via all own neighborhoods on the personal human network. Iteration of matchmaking is used to optimize personal human networks. We simulate the neighborhood matchmaker method with the practical data and the random data and compare the results by our method with those by the central server model. The neighborhood matchmaker method can reach almost the same results obtained by the sever model with each type of data.
CITATION STYLE
Hamasaki, M., & Takeda, H. (2003). Neighborhood matchmaker method: A decentralized optimization algorithm for personal human network. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 2773 PART 1, pp. 929–935). Springer Verlag. https://doi.org/10.1007/978-3-540-45224-9_124
Mendeley helps you to discover research relevant for your work.