0
$\begingroup$

There's a better term for it. Let's say i have a suite of sets - A, B, C, D.

Each set contains any number, in a non-important order, of items - 1,2,3,4,5,6 The items may occur any number (0 or more) of times in a set.

Is there some agreed-upon formula to determine the "most important" item? Or are there algorithms for this?

$\endgroup$
  • $\begingroup$ The question makes no sense unless you tell us your definition of "most important". $\endgroup$ – David C. Ullrich Jan 10 at 19:18
  • $\begingroup$ @DavidC.Ullrich oh! good one! I don't know, i was honestly hoping there would be an algorithm for that. i'm settling for tf-idf, but is there anything else to consider? $\endgroup$ – bharal Jan 10 at 19:52
  • $\begingroup$ "an algorithm for that: an algorithm for what? $\endgroup$ – David C. Ullrich Jan 10 at 22:21

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.