graph based clustering with different attributes on vertices and edge proximity












0












$begingroup$


I would like to apply a clustering based approach on a graph oriented problem where vertices do have a set of attributes in addition to another attribute on the edges. The vertices are people and their attributes could be age, sex, physical characteristics, height, etc. And the edge could be the distance between people like the distance that separates them from where they live.



I kind of want to build clusters based on the attributes on the vertices taking into account the edge attribute like a proximity measure or something similar.



Anyone could help with suggestions would be highly appreciated.










share|improve this question







New contributor




user2567806 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.







$endgroup$

















    0












    $begingroup$


    I would like to apply a clustering based approach on a graph oriented problem where vertices do have a set of attributes in addition to another attribute on the edges. The vertices are people and their attributes could be age, sex, physical characteristics, height, etc. And the edge could be the distance between people like the distance that separates them from where they live.



    I kind of want to build clusters based on the attributes on the vertices taking into account the edge attribute like a proximity measure or something similar.



    Anyone could help with suggestions would be highly appreciated.










    share|improve this question







    New contributor




    user2567806 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
    Check out our Code of Conduct.







    $endgroup$















      0












      0








      0





      $begingroup$


      I would like to apply a clustering based approach on a graph oriented problem where vertices do have a set of attributes in addition to another attribute on the edges. The vertices are people and their attributes could be age, sex, physical characteristics, height, etc. And the edge could be the distance between people like the distance that separates them from where they live.



      I kind of want to build clusters based on the attributes on the vertices taking into account the edge attribute like a proximity measure or something similar.



      Anyone could help with suggestions would be highly appreciated.










      share|improve this question







      New contributor




      user2567806 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.







      $endgroup$




      I would like to apply a clustering based approach on a graph oriented problem where vertices do have a set of attributes in addition to another attribute on the edges. The vertices are people and their attributes could be age, sex, physical characteristics, height, etc. And the edge could be the distance between people like the distance that separates them from where they live.



      I kind of want to build clusters based on the attributes on the vertices taking into account the edge attribute like a proximity measure or something similar.



      Anyone could help with suggestions would be highly appreciated.







      clustering unsupervised-learning similarity distance






      share|improve this question







      New contributor




      user2567806 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.











      share|improve this question







      New contributor




      user2567806 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.









      share|improve this question




      share|improve this question






      New contributor




      user2567806 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.









      asked 7 hours ago









      user2567806user2567806

      1




      1




      New contributor




      user2567806 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.





      New contributor





      user2567806 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.






      user2567806 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.






















          0






          active

          oldest

          votes












          Your Answer





          StackExchange.ifUsing("editor", function () {
          return StackExchange.using("mathjaxEditing", function () {
          StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
          StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
          });
          });
          }, "mathjax-editing");

          StackExchange.ready(function() {
          var channelOptions = {
          tags: "".split(" "),
          id: "557"
          };
          initTagRenderer("".split(" "), "".split(" "), channelOptions);

          StackExchange.using("externalEditor", function() {
          // Have to fire editor after snippets, if snippets enabled
          if (StackExchange.settings.snippets.snippetsEnabled) {
          StackExchange.using("snippets", function() {
          createEditor();
          });
          }
          else {
          createEditor();
          }
          });

          function createEditor() {
          StackExchange.prepareEditor({
          heartbeatType: 'answer',
          autoActivateHeartbeat: false,
          convertImagesToLinks: false,
          noModals: true,
          showLowRepImageUploadWarning: true,
          reputationToPostImages: null,
          bindNavPrevention: true,
          postfix: "",
          imageUploader: {
          brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
          contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
          allowUrls: true
          },
          onDemand: true,
          discardSelector: ".discard-answer"
          ,immediatelyShowMarkdownHelp:true
          });


          }
          });






          user2567806 is a new contributor. Be nice, and check out our Code of Conduct.










          draft saved

          draft discarded


















          StackExchange.ready(
          function () {
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fdatascience.stackexchange.com%2fquestions%2f48884%2fgraph-based-clustering-with-different-attributes-on-vertices-and-edge-proximity%23new-answer', 'question_page');
          }
          );

          Post as a guest















          Required, but never shown

























          0






          active

          oldest

          votes








          0






          active

          oldest

          votes









          active

          oldest

          votes






          active

          oldest

          votes








          user2567806 is a new contributor. Be nice, and check out our Code of Conduct.










          draft saved

          draft discarded


















          user2567806 is a new contributor. Be nice, and check out our Code of Conduct.













          user2567806 is a new contributor. Be nice, and check out our Code of Conduct.












          user2567806 is a new contributor. Be nice, and check out our Code of Conduct.
















          Thanks for contributing an answer to Data Science Stack Exchange!


          • Please be sure to answer the question. Provide details and share your research!

          But avoid



          • Asking for help, clarification, or responding to other answers.

          • Making statements based on opinion; back them up with references or personal experience.


          Use MathJax to format equations. MathJax reference.


          To learn more, see our tips on writing great answers.




          draft saved


          draft discarded














          StackExchange.ready(
          function () {
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fdatascience.stackexchange.com%2fquestions%2f48884%2fgraph-based-clustering-with-different-attributes-on-vertices-and-edge-proximity%23new-answer', 'question_page');
          }
          );

          Post as a guest















          Required, but never shown





















































          Required, but never shown














          Required, but never shown












          Required, but never shown







          Required, but never shown

































          Required, but never shown














          Required, but never shown












          Required, but never shown







          Required, but never shown







          Popular posts from this blog

          Aikido

          Tivadar Csontváry Kosztka

          Metroo de Marsejlo