blocks|key|2049063|text|你可以这样做：|type|unstyled|depth|inlineStyleRanges|entityRanges|data|2049064|var+array1+=+[val1,val2,val3];
var+array2+=+[val1,val4,val5];
var+sim+=+[];
var+simscore+=+9;

if+(array1.length+>+array2.length)+{
++++++for+(var+i+=+0;+i+<+array1.length;+i%2B%2B)+{
++++++++++++if(array1[i]+==+array2[i])+{
+++++++++++++++++++sim.push(i);
+++++++++++++++++++simarr+=+array1;
+++++++++++++++++++simscore+%2B%2B;
+++++++++++++}
+++++++}
}else{
+++++++for+(var+i+=+0;+i+<+array2.length;+i%2B%2B)+{
++++++++++++if(array1[i]+==+array2[i])+{
+++++++++++++++++++sim.push(i);
+++++++++++++++++++simarr+=+array2;
+++++++++++++++++++simscore+%2B%2B;
+++++++++++++}
+++++++}
}
console.log(sim);
console.log("Percent+similar:+",+simscore/simarr.length);|code-block|syntax|javascript|2049065|这会将相似索引添加到数组sim中，并将相似索引的计数增加1+(总是针对较长的数组)，然后打印相似百分比。|offset|length|style|CODE|2049066|entityMap^0|0|0|C|3|0^^$0|@$1|2|3|4|5|6|7|O|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|P|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|6|7|Q|8|@$I|R|J|S|K|L]]|9|@]|A|$]]|$1|M|3|-4|5|6|7|T|8|@]|9|@]|A|$]]]|N|$]]

<p>You could do something like this:</p>

<pre><code>var array1 = [val1,val2,val3];
var array2 = [val1,val4,val5];
var sim = [];
var simscore = 9;

if (array1.length &gt; array2.length) {
      for (var i = 0; i &lt; array1.length; i++) {
            if(array1[i] == array2[i]) {
                   sim.push(i);
                   simarr = array1;
                   simscore ++;
             }
       }
}else{
       for (var i = 0; i &lt; array2.length; i++) {
            if(array1[i] == array2[i]) {
                   sim.push(i);
                   simarr = array2;
                   simscore ++;
             }
       }
}
console.log(sim);
console.log("Percent similar: ", simscore/simarr.length);
</code></pre>

<p>This will add the similar index to an array <code>sim</code> and increase the count of similar indexes by 1, always for the longer array, then print the percent of similarity. </p>


blocks|key|5455142|text|您可以获取这些值并计算公共分数。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|5455143|​|5455144|function+similarityPercentage(arrayA,+arrayB)+{++++++++++++
++++return+100+*+arrayA.filter(Set.prototype.has,+new+Set(arrayB)).length+/+Math.max(arrayA.length,+arrayB.length);
}

function+similarities(a,+b)+{
++++var+parts+=+a.map((o,+i)+=>+similarityPercentage(Object.values(o)[0],+Object.values(b[i])[0]));
++++return+parts.reduce((a,+b)+=>+a+%2B+b,+0)+/+parts.length;
}

var+array1+=+[{+key1:+['item1',+'item2',+'item3',+'item4']+},+{+key2:+['event3',+'event4']+}],
++++array2+=+[{+key1:+['item1',+'item4',+'item2',+'item8']+},+{+key2:+['event4',+'event2']+}],
++++arrayA+=+['item1',+'item2',+'item3',+'item4'],
++++arrayB+=+['item1',+'item4',+'item2',+'item8'];

console.log(similarityPercentage(arrayA,+arrayB));+//+75
console.log(similarities(array1,+array2));+++++++++//+62.5|code-block|syntax|javascript|5455145|5455146|entityMap^0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|L|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|M|8|@]|9|@]|A|$]]|$1|D|3|E|5|F|7|N|8|@]|9|@]|A|$G|H]]|$1|I|3|C|5|6|7|O|8|@]|9|@]|A|$]]|$1|J|3|-4|5|6|7|P|8|@]|9|@]|A|$]]]|K|$]]

<p>You could get the values and calculate the common score.</p>

<p><div class="snippet" data-lang="js" data-hide="false" data-console="true" data-babel="false">
<div class="snippet-code">
<pre class="snippet-code-js lang-js prettyprint-override"><code>function similarityPercentage(arrayA, arrayB) {            
    return 100 * arrayA.filter(Set.prototype.has, new Set(arrayB)).length / Math.max(arrayA.length, arrayB.length);
}

function similarities(a, b) {
    var parts = a.map((o, i) =&gt; similarityPercentage(Object.values(o)[0], Object.values(b[i])[0]));
    return parts.reduce((a, b) =&gt; a + b, 0) / parts.length;
}

var array1 = [{ key1: ['item1', 'item2', 'item3', 'item4'] }, { key2: ['event3', 'event4'] }],
    array2 = [{ key1: ['item1', 'item4', 'item2', 'item8'] }, { key2: ['event4', 'event2'] }],
    arrayA = ['item1', 'item2', 'item3', 'item4'],
    arrayB = ['item1', 'item4', 'item2', 'item8'];

console.log(similarityPercentage(arrayA, arrayB)); // 75
console.log(similarities(array1, array2));         // 62.5</code></pre>
</div>
</div>
</p>


blocks|key|2049121|text|首先，您的示例数组结构不好，如果您重新组织它们，您的问题可以更快地解决。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|2049122|由于您还没有提供计算array1和array2之间相似度的公式，因此我假设这些数组中的每个数组都具有相等的长度，并且其中的每一项都表示一个只有一个属性(具有相同名称)的对象，并且该属性本身就是一个数组。一种明显的方法是计算要计算的这两个数组的相关子数组的每个相似性分数，然后通过平均每个键的相似性分数来计算总相似性。|2049123|假设：|2049124|2049125|array1和array2的长度相等array1的第n个元素只有一个名为keyFoo的属性，array2的第n个元素也只有一个名为keyFoo的属性，这两个数组的keyFoo属性是数组本身，必须相互比较。|unordered-list-item|2049126|2049127|这可以使用已经提供的SimilarityPercentage函数快速完成：|offset|length|style|CODE|2049128|​|2049129|function+SimilarityPercentage2+(array1,+array2)+{
++let+similaritySum+=+0;
++
++for+(let+i+=+0;+i+<+array1.length;+i%2B%2B)+{
++++const+elem+=+array1[i];
++++
++++const+key+=+Object.keys(elem)[0];
++++
++++similaritySum+%2B=+SimilarityPercentage(elem[key],+array2[i][key]);
++}
++
++return+similaritySum+/+array1.length;
}

console.log(SimilarityPercentage2(array1,+array2));
//+output:+62.5|code-block|syntax|javascript|2049130|2049131|entityMap^0|0|0|0|0|0|0|A|K|0|0|0|0^^$0|@$1|2|3|4|5|6|7|10|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|11|8|@]|9|@]|A|$]]|$1|D|3|E|5|6|7|12|8|@]|9|@]|A|$]]|$1|F|3|-4|5|6|7|13|8|@]|9|@]|A|$]]|$1|G|3|H|5|I|7|14|8|@]|9|@]|A|$]]|$1|J|3|-4|5|6|7|15|8|@]|9|@]|A|$]]|$1|K|3|L|5|6|7|16|8|@$M|17|N|18|O|P]]|9|@]|A|$]]|$1|Q|3|R|5|6|7|19|8|@]|9|@]|A|$]]|$1|S|3|T|5|U|7|1A|8|@]|9|@]|A|$V|W]]|$1|X|3|R|5|6|7|1B|8|@]|9|@]|A|$]]|$1|Y|3|-4|5|6|7|1C|8|@]|9|@]|A|$]]]|Z|$]]

<p>First of all, your sample arrays are not well-structured, and your problem can be done more quickly if you restructure them.</p>

<p>Since you have not provided a formula for calculating the similarity between <em>array1</em> and <em>array2</em>, I assume that every each of these arrays has equal length, and every item in them represents an object which has only one property (with the same name), and that property itself is an array. One obvious approach is to calculate every similarity score of the related child arrays of these two arrays to be calculated and then calculate the total similarity by averaging every key's similarity score.</p>

<p>Assumptions:</p>

<ul>
<li><em>array1</em> and <em>array2</em> have equal length</li>
<li>The <em>nth</em> element of <em>array1</em> has only one property with the name <em>keyFoo</em> and the <em>nth</em> element of <em>array2</em> also has only one property with the name <em>keyFoo</em> and <em>keyFoo</em> property of these two arrays are arrays themselves and must be compared to each other.</li>
</ul>

<p>This quickly can be done using already provided <code>SimilarityPercentage</code> function:</p>

<p><div class="snippet" data-lang="js" data-hide="false" data-console="true" data-babel="false">
<div class="snippet-code">
<pre class="snippet-code-js lang-js prettyprint-override"><code>function SimilarityPercentage2 (array1, array2) {
  let similaritySum = 0;
  
  for (let i = 0; i &lt; array1.length; i++) {
    const elem = array1[i];
    
    const key = Object.keys(elem)[0];
    
    similaritySum += SimilarityPercentage(elem[key], array2[i][key]);
  }
  
  return similaritySum / array1.length;
}

console.log(SimilarityPercentage2(array1, array2));
// output: 62.5</code></pre>
</div>
</div>
</p>


<p>I am attempting to compare two array of object and assigning them a similarity score based of common items in the array.  </p>

<p>I was able to compare the arrays but I am running into issue with using the same concept on array of objects. </p>

<p><div class="snippet" data-lang="js" data-hide="false" data-console="true" data-babel="false">
<div class="snippet-code">
<pre class="snippet-code-js lang-js prettyprint-override"><code>let array1 = [{key1:['item1','item2','item3','item4']},{key2:['event3','event4']}];
let array2 = [{key1:['item1','item4','item2','item8']},{key2:['event4','event2']}];

let arrayA=['item1','item2','item3','item4'];
let arrayB=['item1','item4','item2','item8'];
function SimilarityPercentage(arrayA,arrayB){
  let answer =arrayA.filter(function(item) {
     return arrayB.indexOf(item) &gt;= 0;
  }).length
  return answer/(Math.max(arrayA.length,arrayB.length))*100
}
console.log(SimilarityPercentage(arrayA,arrayB));// 75 </code></pre>
</div>
</div>
</p>

<p>Given array1 and array2 , I would like the result split out a similarity score, similar to the function above. I would like to use the rand index calculation : <a href="https://en.wikipedia.org/wiki/Rand_index#targetText=The%20Rand%20index%20or%20Rand,is%20the%20adjusted%20Rand%20index" rel="nofollow noreferrer">https://en.wikipedia.org/wiki/Rand_index#targetText=The%20Rand%20index%20or%20Rand,is%20the%20adjusted%20Rand%20index</a>. </p>


comparing array of objects and assigning similarity score

翻译质量差，导致语言生硬或混乱。

没有提供实际的解决方法或示例。

解答不清晰，无法理解或解决问题。

页面排版不美观，阅读体验差。

文章

问答

视频

学习中心

腾讯云实验室

直播

竞赛

腾讯云代码分析专区

腾讯iOA零信任安全管理系统专区

腾讯云架构师技术同盟交流圈

腾讯云数据库专区

腾讯云顾问专区

腾讯云原生专区

腾讯混元专区

腾讯云TCE专区

腾讯云Lighthouse专区

腾讯云HAI专区

腾讯云Edgeone专区

腾讯云存储专区

腾讯云智能专区

腾讯轻联专区 

腾讯云开发专区

TAPD专区

腾讯轻量云游戏服专区

腾讯云最具价值专家

腾讯云架构师技术同盟

腾讯云创作之星

腾讯云开发者先锋

腾讯云代码助手

云原生构建

TAPD 敏捷项目管理

Cloud Studio

SDK中心

API中心

命令行工具

涵盖代码开发、场景应用、自动测试全流程，助你从零构建专属AI助手

一站式MCP教程库，解锁AI应用新玩法

我正在尝试比较两个对象数组，并根据数组中的常见项为它们分配一个相似度分数。我能够比较数组，但在对象数组上使用相同的概念时遇到了问题。​let array1 = [{key1:['item1','item2','item3','item4']},{key2:['event3','event4']}];let array2...

问比较对象数组并分配相似度分数
EN

Stack Overflow用户

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问比较对象数组并分配相似度分数EN