132 reputation
7
bio website cherhan.net
location Brisbane, Australia
age 32
visits member for 2 years, 10 months
seen Feb 17 at 1:00

I am a PhD student from Queensland University of Technology (QUT) at the beautiful Brisbane City, Australia. My research interest is on social media analytics and text mining. My personal interest on programming span across C#, Python, Ruby and HTML5, CSS3 web programming. I am also a Microsoft Certified Application Developer for .NET and Microsoft Office Expert World Champion on Microsoft Excel and National Champion for Microsoft Word.


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
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
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
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)$ ?
Jan
8
comment Burstiness Calculation
Probably the example I gave wasn't too good, the actual data is about 14 days, so the actual burstiness among group wasn't really significant
Dec
20
comment Help on mathematical notation and formalisation for the following description
Thanks a lot :)
Dec
20
comment Help on mathematical notation and formalisation for the following description
Thanks Hauke, I think I know the problem. It should be $\sum_{t \in p}$, if the sum is greater, means it is more important, does that make sense to you now?
Dec
20
comment Help on mathematical notation and formalisation for the following description
It is an unordered tuple, I found some papers that describe this if it is an ordered tuple, e.g. Wu et al. "Deploying approaches for pattern refinement in text mining"
Dec
5
comment Set notation “element-of” multiple sets
Yes that sounds good, I will begin with some discrete maths reading and move on from there, thanks!
Dec
5
comment Set notation “element-of” multiple sets
@PatrickDaSilva: No, I am particularly interested in mathematical notation and formalisation of algorithm (please let me know if it's still too vague)
Dec
5
comment Set notation “element-of” multiple sets
DylanMoreland: agree, @PatrickDaSilva:thanks. A bit newbie to mathematical notation and formalisation from a coder background. I was wondering is there any books on such topics or good material to learn?
Dec
5
comment Set notation “element-of” multiple sets
so there is no such thing as {$e \in X,Y$} I supposed?