Team:Paris Liliane Bettencourt/Project/SIP
From 2010.igem.org
Ericmeltzer (Talk | contribs) (→Find iGEM winner with satistics) |
|||
Line 34: | Line 34: | ||
</html> | </html> | ||
- | == Find iGEM winner with | + | == Find iGEM winner with statistics == |
<p style="display:block"> | <p style="display:block"> | ||
<br /> | <br /> | ||
- | This year, iGEM team Paris has made a software to | + | This year, iGEM team Paris has made a software to analyze the word content of iGEM wikis. The first view to use this software was, to find '''who will win the iGEM competition'''. We had several aproach to find that, using data on the wikis.<br /> |
- | + | To analyse the wiki, we have implemented an algorithm called '''SIP''' ('''Statistically Improbable Phrases'''), which is most famously used by the Amazon website to characterize their books. We try to find which are the most improbable words in a large sample (we use all iGEM wiki) but the most probable in the context. We can, with this way, have some '''original words''' from some teams, but also '''characterize''' their wiki by specifics words or terms. Amazon algorithm is not open, so we have use simple math to describe the system. | |
<br /> | <br /> |
Revision as of 20:26, 26 October 2010
Find iGEM winner with statistics
This year, iGEM team Paris has made a software to analyze the word content of iGEM wikis. The first view to use this software was, to find who will win the iGEM competition. We had several aproach to find that, using data on the wikis.
To analyse the wiki, we have implemented an algorithm called SIP (Statistically Improbable Phrases), which is most famously used by the Amazon website to characterize their books. We try to find which are the most improbable words in a large sample (we use all iGEM wiki) but the most probable in the context. We can, with this way, have some original words from some teams, but also characterize their wiki by specifics words or terms. Amazon algorithm is not open, so we have use simple math to describe the system.
In Math language :
- We have f/F
- f the frequence of the word in the context : f = o/n (o is the occurence of the word, and n the number of words in the wiki).
- F the frequence of the same word in a large sample : F = O/N (O, occurence in the sample, and N the number of words in the sample).
In this code, we use wget software to get all wiki of one year, then we remove all character non-alpha-numeric, and convert to lower case. New we compute the frenquencies of each words in a sqlite3 database.
We have extracted and calculated this for the last 3 years. Available on the bottom of the page.
We have displayed these words with graphical effects using [http://www.wordle.net/create this software written in java] with different parameters.
For future, we will try next time to compare this words with words used in Instructor's papers (using ENTREZ API), to determine how Instructors influence the team. We think in the last part that an influence by the Instructor has positive results on the team, a better cooperation between memberships.
References
- http://en.wikipedia.org/wiki/Statistically_Improbable_Phrases
- http://petewarden.typepad.com/searchbrowser/2008/01/whats-the-secre.html