Sciweavers

1950 search results - page 112 / 390
» Informative sampling for large unbalanced data sets
Sort
View
168
Voted
JCDL
2011
ACM
226views Education» more  JCDL 2011»
14 years 6 months ago
Measuring historical word sense variation
We describe here a method for automatically identifying word sense variation in a dated collection of historical books in a large digital library. By leveraging a small set of kno...
David Bamman, Gregory Crane
CVPR
2009
IEEE
16 years 10 months ago
Regularized Multi-Class Semi-Supervised Boosting
Many semi-supervised learning algorithms only deal with binary classification. Their extension to the multi-class problem is usually obtained by repeatedly solving a set of bina...
Amir Saffari, Christian Leistner, Horst Bischof
CPM
1999
Springer
144views Combinatorics» more  CPM 1999»
15 years 7 months ago
Ziv Lempel Compression of Huge Natural Language Data Tries Using Suffix Arrays
We present a very efficient, in terms of space and access speed, data structure for storing huge natural language data sets. The structure is described as LZ (Ziv Lempel) compresse...
Strahil Ristov, Eric Laporte
142
Voted
PADL
2000
Springer
15 years 7 months ago
Calculating a New Data Mining Algorithm for Market Basket Analysis
The general goal of data mining is to extract interesting correlated information from large collection of data. A key computationally-intensive subproblem of data mining involves ...
Zhenjiang Hu, Wei-Ngan Chin, Masato Takeichi
120
Voted
AAAI
2010
15 years 3 months ago
Multi-Task Sparse Discriminant Analysis (MtSDA) with Overlapping Categories
Multi-task learning aims at combining information across tasks to boost prediction performance, especially when the number of training samples is small and the number of predictor...
Yahong Han, Fei Wu, Jinzhu Jia, Yueting Zhuang, Bi...