Groups
Groups
Sign in
Groups
Groups
MetaOptimize Challenge [discuss]
Conversations
About
Send feedback
Help
MetaOptimize Challenge [discuss]
1–13 of 13
Mark all as read
Report group
0 selected
probreasoning
1/21/11
LLR type analysis
I used a log likelihood ratio type analysis. I've posted the approach over at https://
unread,
LLR type analysis
I used a log likelihood ratio type analysis. I've posted the approach over at https://
1/21/11
Leonid Volnitsky
1/10/11
Who won?
It is possible that I've missed the memo, I didn't followed this very actively. There is no
unread,
Who won?
It is possible that I've missed the memo, I didn't followed this very actively. There is no
1/10/11
ivan
,
Joseph Turian
3
11/25/10
Latent Dirichlet Allocation
Hello All, I have a quick update on (unsuccessful) results from using topic models for the challenge.
unread,
Latent Dirichlet Allocation
Hello All, I have a quick update on (unsuccessful) results from using topic models for the challenge.
11/25/10
Sandeep
,
Joseph Turian
2
11/23/10
Why cant SemanticVectors be used directly ?
Sandeep, I would be very interested to see a SemanticVectors based approach. This seems like a
unread,
Why cant SemanticVectors be used directly ?
Sandeep, I would be very interested to see a SemanticVectors based approach. This seems like a
11/23/10
Timothy Flynn
11/14/10
Scoring script
I just checked in some additions to my github code for this challenge (https://github.com/tgflynn/NLP
unread,
Scoring script
I just checked in some additions to my github code for this challenge (https://github.com/tgflynn/NLP
11/14/10
Rob Speer
11/14/10
What are the documents intended to represent?
I am left with some questions about this challenge. One big one is: what are these documents intended
unread,
What are the documents intended to represent?
I am left with some questions about this challenge. One big one is: what are these documents intended
11/14/10
rspeer
11/13/10
AnalogySpace
I may be biased, but I'd say Akshay makes a good point. :) Since we Open Mind people clearly
unread,
AnalogySpace
I may be biased, but I'd say Akshay makes a good point. :) Since we Open Mind people clearly
11/13/10
Christian
,
Joseph Turian
2
11/7/10
Evaluation
> This presumes that the people who vote are representative of the > semantics encoded in your
unread,
Evaluation
> This presumes that the people who vote are representative of the > semantics encoded in your
11/7/10
Christian
, …
Olivier Grisel
3
11/6/10
Why not clean the vocabulary?
2010/11/7 Alexandre Passos <alexan...@gmail.com>: > On Sun, Nov 7, 2010 at 00:08,
unread,
Why not clean the vocabulary?
2010/11/7 Alexandre Passos <alexan...@gmail.com>: > On Sun, Nov 7, 2010 at 00:08,
11/6/10
Slava V
, …
Joseph Turian
3
11/6/10
2 solutions
Also, share the output, so your technique can participate in the evaluation. On Sat, Nov 6, 2010 at 3
unread,
2 solutions
Also, share the output, so your technique can participate in the evaluation. On Sat, Nov 6, 2010 at 3
11/6/10
akshay bhat
,
Dragon Silicon
3
11/6/10
Solution Using Analogy Space
There is no linguistic specific optimization hack as such, and the method can be applied to other
unread,
Solution Using Analogy Space
There is no linguistic specific optimization hack as such, and the method can be applied to other
11/6/10
Dragon Silicon
2
11/6/10
Metaoptimize challenge
Sources of the solution: http://88.151.103.8/similarity/ (both .py files) On Sat, Nov 6, 2010 at 6:40
unread,
Metaoptimize challenge
Sources of the solution: http://88.151.103.8/similarity/ (both .py files) On Sat, Nov 6, 2010 at 6:40
11/6/10
Timothy Flynn
11/6/10
Co-occurrence frequencies
It seems to me that just using co-occurrence frequencies should work for this problem. I've
unread,
Co-occurrence frequencies
It seems to me that just using co-occurrence frequencies should work for this problem. I've
11/6/10
