Alert icon
We're changing our privacy policy. This stuff matters.  Learn more  Dismiss

Browsing into Data Masses

Loading...

Sign in or sign up now!
Alert icon
Upgrade to the latest Flash Player for improved playback performance. Upgrade now or more info.
601 views
Loading...
Alert icon
Sign in or sign up now!
Alert icon

Uploaded by on Apr 18, 2008

Web Site: http://romain.raveaux.free.fr

A Clustering algorithm is applied on graphs and a visual interpretation is proposed.

Model-Driven Engineering (MDE) promotes the use of models as first class
citizens. As a consequence, dealing with a wide variety of modeling languages
can be a cumbersome task. Developing tools and methods for dealing with its
variety of models is a challenging task for the MDE community. In this paper,
we propose a method for identifying families of modeling languages in
megamodels. This approach makes use of graph mining methods for automatically
labeled metamodels with a partitional clustering algorithm applied on a set of
features called graph probing. Metamodels tagged with the same labels form a
“Family” what is to say sharing common substructures. Finally, a
statistical cooccurrence matrix was computed on class names and association
roles to bring a semantic meaning to each metamodel family, building somehow a
tag cloud of the family.

Category:

Science & Technology

Tags:

License:

Standard YouTube License

  • likes, 0 dislikes

Link to this comment:

Share to:
see all

All Comments (0)

Sign In or Sign Up now to post a comment!
Loading...

Alert icon
0 / 00Unsaved Playlist Return to active list
    1. Your queue is empty. Add videos to your queue using this button:
      or sign in to load a different list.
    Loading...Loading...Saving...
    • Clear all videos from this list
    • Learn more