Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • Home
  • SEARCH
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 7573967
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 30, 20262026-05-30T16:18:56+00:00 2026-05-30T16:18:56+00:00

this is a bit algorithmic and I’m not sure if it’s fit correctly under

  • 0

this is a bit algorithmic and I’m not sure if it’s fit correctly under SO, let me know if it doesn’t.

I want to implement some kind of distance or similarity function between two labeled star-graphs. For example I can have the following to graph representations:

A = [3 -1   0;
     4  1   0;
     2  0   1;
     2  0  -1]

and

B = [3 -0.8   1
     4  1.4   0.4;
     2  0.1   1.9]

My idea (which is actually based mostly on a paper I’m reading) is to perform some kind of belief propagation: Let’s say that A is the observed graph – each row is a neighbor of a central node, the first column is the label, the second is the x position and the third one is the y position (positions are relative to the central node). B is a graph in out database, and I want to see how close or similar they are.

In the paper they are calculating the likelihood for the observed graph A given B as the product of the likelihoods for all the nodes. How would you implement this efficiently in matlab?

I would appreciate any thought or inspiration, I’m not looking for a code to solve it, I just want to learn from you masters how would you approach this problem.

Thanks,

J

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-05-30T16:18:57+00:00Added an answer on May 30, 2026 at 4:18 pm

    Having had only a cursory look at that paper, I think what you are looking for is an algorithm for inference in Bayesian networks. There are notoriously computationally expensive and hard to implement, so I do recommend looking for ready-made solutions. Google returns plenty of hits for “matlab graphical models”

    — EDIT —

    The website posted in one of the comments looks quite detailed, but may be slightly outdated (2005). I’d like to recommend a different piece of software.
    I have been using MALLET for a while and I find it quite OK. The authors are really well known in the NLP community. Turns out there is an extension that allows for arbitrary graphical structure- GRMM. Written in Java, open-source. I haven’t used it myself.

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I need some advice on how to tackle an algorithmic problem (ie. not programming
I don't know if this is the place to ask about algorithms. But let's
Im doing some studying and im a bit confused on this little nondeterministic algorithm
This is a bit tricky question for you computer scientists. Let's say that I
This bit of code is taking almost a half second to execute. Could somebody
This bit of code comes with new classes that are subclasses of UITableViewController... -
To this bit of code I pass the string kellogs special k and I
IS this bit of code in PHP/mysql considered a stored procedure? $sql = 'SELECT
Consider this bit of obfuscated code. The intention is to create a new object
I have this bit of javascript written with jQuery 1.2.5. It's contained inside the

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.