In this competition, you work on text classification using supervised learning.
Classify given text documents into two categories.
Each document is represented as a sequence of (encoded) words.
A bag-of-words vectorization of each document is also provided as an easy access to the data.
About the word encoding:
Each word is coded with a particular encoding rule.
For example, “Fly”, “Flying” and “flight” are coded to “F86155”, “F86155b43” and “f86155j152”, respectively.
- Problem type
- Evaluation metric
- Area under the ROC curve (AUC)
- Competition status
- 2014/11/19 00:00 (Japan Standard Time)
- 2014/12/31 23:59 (Japan Standard Time)
- Invitation setting
- Open to everyone
1st place winner (n.otani) and 2nd place winner (Vagif) kindly share their solutions.
Download dataset and submission
You are only allowed to download the dataset and make a submission during the competition.
|Final rank||Nickname||Final score||Intermediate score|
|12||University of Big Data||0.67896||0.65746|
This leaderboard is calculated on the latest submissions.
The intermediate scores are calculated using 50% of the test dataset, and the final scores are calculated using the other 50%.
Final ranks are determined according to the final scores.
Scores over time (Final score)
Your submission timeline
You have not made any submission yet.