From Labels to Graph: what machine learning approaches to use?

Data Science Asked by Hamed on December 9, 2020

Imagine a world where we have places (e.g., cities, restaurants, national parks, etc.) but no roads connecting them.

Our objective is to build roads connecting any two places while going through some given places. For instance, connect Seattle to San Francisco and make sure the connection goes through restaurants X and Y and goes through the Red Wood national park. Note, there is not necessarily one possible road, hence multiple options as output are also acceptable.

We have some roads as examples to train the system. For instance, we have a road from Washington DC to Boston that goes through Baltimore.

So, the input to a machine learning system will be a list of strings (e.g., city names and places to go through) and the expected output is a tree/graph that connects the given points.

(Note, this cannot be a graph traversing problem, as a path the connects the points does not exist.)

I want a machine learning model that can produce/generate a novel graph in the output given a set of labels.

Any thoughts on what ML machine learning methods I can use and where to start?

Update 1

Note that I have neither of the following:

  1. A graph of route(s) from Seatle to San Francisco;
  2. A larger graph that contains a route from Seatle to San Francisco.

Instead, I have graphs for routes from Los Angles to Texas (with stops for eating and seeing landscape), from Milan to Rome, and etc.

Therefore, I think this is not a graph searching problem.

Update 2

I take that the initial question was not clear, so I reworded it.

One Answer

Your graph is characterized by a set of nodes and edges. It means given a start point x, show me the next node z1, then from z1 show me z2 and so on. This looks like the definition of graph-searching algorithm.

However, maybe by definining a 'cost function' that you want to optimize (minimize or maximize) you can convert it to a supervised learning task. Basically, given a graph composed of weighted nodes and edges, you want to choose a subset (E,V) that minimzes the cost function.

I am not sure this problem fits a generative problem (as you emphasize on the word generate) whose goal is to learn a distribution.

Answered by YAS on December 9, 2020

Add your own answers!

Related Questions

How to handle unseen labels in test data?

1  Asked on August 22, 2020 by meysam


In a list, find the numbers where they are bigger than the next numbers

1  Asked on August 21, 2020 by ellen-sheldon


Neural networks: how to think of it?

0  Asked on August 18, 2020 by luca-di-mauro


MLPRegressor Output Range

2  Asked on August 18, 2020 by kam


Ask a Question

Get help from others!

© 2022 All rights reserved. Sites we Love: PCI Database, MenuIva, UKBizDB, Menu Kuliner, Sharing RPP