Reputation
Top tag
Next privilege 250 Rep.
View close votes
Badges
7
Newest
 Editor
Impact
~806 people reached

  • 0 posts edited
  • 0 helpful flags
  • 5 votes cast
Oct
27
awarded  Editor
Oct
27
comment Sum of a set normalize by total items in set
It's ok, I guess they are doing this for my good too. They want me to learn by myself through the hard way so that I will remember it by heart.
Oct
27
comment Sum of a set normalize by total items in set
I did say that "I have a set of weighted terms, $w_1, w_2$... but I included more information now.
Oct
27
revised Sum of a set normalize by total items in set
added 129 characters in body
Oct
27
comment Sum of a set normalize by total items in set
@BISHD I am more that happy to edit and learn and improve the answer so that it benefits everyone else too. But NO information provided to advise how/what should I improve?
Oct
27
accepted Sum of a set normalize by total items in set
Oct
27
comment Sum of a set normalize by total items in set
Thanks very much.
Oct
27
comment Sum of a set normalize by total items in set
For the guys who downvoted, that's very helpful. Thanks very much.
Oct
27
comment Sum of a set normalize by total items in set
I understand that, and $w$ is the individual item in $W$, what I want is to avoid using $W$ just because I want to show $\left | W \right |$ if it's possible
Oct
27
comment Sum of a set normalize by total items in set
I am cool to get a downvote like I said this is a simple question and I am clarifying it. But for the nice guy who downvoted would you be nice again and explain why do I get a downvote?
Oct
27
comment Sum of a set normalize by total items in set
$w$ is a set of weighted terms. Count of $w$ is total number of terms, i.e. $n$
Oct
27
asked Sum of a set normalize by total items in set
Oct
16
accepted Set notation “element-of” multiple sets
Oct
16
accepted Symbol for “if any”
Oct
16
comment Symbol for “if any”
Thanks for your useful comment, it is more for an algorithm writing than mathematical writing. What I really want to mean is, if there exist $p_i$, where $length(p_i) = length(p) + 1$ and $p$ is a strict subset of $p_i$
Oct
16
comment Symbol for “if any”
if $∃pi : length(pi) = length(p) + 1 ∧ p ⊏ pi ∧ support(p) = support(pi)$ ?
Oct
16
asked Symbol for “if any”
Jan
8
awarded  Commentator
Jan
6
asked Normalising Standard Deviation as score for Burstiness calculation
Dec
20
awarded  Scholar