hclust count number of merges & first merge height for anomaly detection












0















I am using hclust function from R for hierarchical clustering. I am planning to use it for anomaly detection.



For detecting anomalies, I need a function that counts the merges that need to be done from leaf to the root.



Based on the image linked I need a function f1(x) that gives



f1(3) = 2 
f1(7) = f1(6) = 3
f1(2) = 4


Following a similar desire to detect anomalies, I also need another function f2(x) to find the first merging hight for individual leaves. For the same picture given



f2(3) ~ 0.7
f2(7) ~ 0.35 etc.


Thank you



Example dendogram










share|improve this question





























    0















    I am using hclust function from R for hierarchical clustering. I am planning to use it for anomaly detection.



    For detecting anomalies, I need a function that counts the merges that need to be done from leaf to the root.



    Based on the image linked I need a function f1(x) that gives



    f1(3) = 2 
    f1(7) = f1(6) = 3
    f1(2) = 4


    Following a similar desire to detect anomalies, I also need another function f2(x) to find the first merging hight for individual leaves. For the same picture given



    f2(3) ~ 0.7
    f2(7) ~ 0.35 etc.


    Thank you



    Example dendogram










    share|improve this question



























      0












      0








      0








      I am using hclust function from R for hierarchical clustering. I am planning to use it for anomaly detection.



      For detecting anomalies, I need a function that counts the merges that need to be done from leaf to the root.



      Based on the image linked I need a function f1(x) that gives



      f1(3) = 2 
      f1(7) = f1(6) = 3
      f1(2) = 4


      Following a similar desire to detect anomalies, I also need another function f2(x) to find the first merging hight for individual leaves. For the same picture given



      f2(3) ~ 0.7
      f2(7) ~ 0.35 etc.


      Thank you



      Example dendogram










      share|improve this question
















      I am using hclust function from R for hierarchical clustering. I am planning to use it for anomaly detection.



      For detecting anomalies, I need a function that counts the merges that need to be done from leaf to the root.



      Based on the image linked I need a function f1(x) that gives



      f1(3) = 2 
      f1(7) = f1(6) = 3
      f1(2) = 4


      Following a similar desire to detect anomalies, I also need another function f2(x) to find the first merging hight for individual leaves. For the same picture given



      f2(3) ~ 0.7
      f2(7) ~ 0.35 etc.


      Thank you



      Example dendogram







      r hierarchical-clustering anomaly-detection hclust






      share|improve this question















      share|improve this question













      share|improve this question




      share|improve this question








      edited Nov 20 '18 at 11:19







      Mehmet Umut çağlar

















      asked Nov 20 '18 at 10:49









      Mehmet Umut çağlarMehmet Umut çağlar

      12




      12
























          0






          active

          oldest

          votes











          Your Answer






          StackExchange.ifUsing("editor", function () {
          StackExchange.using("externalEditor", function () {
          StackExchange.using("snippets", function () {
          StackExchange.snippets.init();
          });
          });
          }, "code-snippets");

          StackExchange.ready(function() {
          var channelOptions = {
          tags: "".split(" "),
          id: "1"
          };
          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: true,
          noModals: true,
          showLowRepImageUploadWarning: true,
          reputationToPostImages: 10,
          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
          });


          }
          });














          draft saved

          draft discarded


















          StackExchange.ready(
          function () {
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53391358%2fhclust-count-number-of-merges-first-merge-height-for-anomaly-detection%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
















          draft saved

          draft discarded




















































          Thanks for contributing an answer to Stack Overflow!


          • 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.


          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%2fstackoverflow.com%2fquestions%2f53391358%2fhclust-count-number-of-merges-first-merge-height-for-anomaly-detection%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

          Guess what letter conforming each word

          Port of Spain

          Run scheduled task as local user group (not BUILTIN)