Sciweavers

2229 search results - page 195 / 446
» Comparative analysis of biclustering algorithms
Sort
View
WWW
2007
ACM
16 years 1 months ago
A new suffix tree similarity measure for document clustering
In this paper, we propose a new similarity measure to compute the pairwise similarity of text-based documents based on suffix tree document model. By applying the new suffix tree ...
Hung Chim, Xiaotie Deng
NIPS
2008
15 years 2 months ago
Improved Moves for Truncated Convex Models
We consider the problem of obtaining the approximate maximum a posteriori estimate of a discrete random field characterized by pairwise potentials that form a truncated convex mod...
M. Pawan Kumar, Philip H. S. Torr
CSUR
2004
91views more  CSUR 2004»
15 years 25 days ago
Line drawing, leap years, and Euclid
Bresenham's algorithm minimizes error in drawing lines on integer grid points; leap year calculations, surprisingly, are a generalization. We compare the two calculations, exp...
Mitchell A. Harris, Edward M. Reingold
AAAI
2012
13 years 3 months ago
Transfer Learning with Graph Co-Regularization
Transfer learning proves to be effective for leveraging labeled data in the source domain to build an accurate classifier in the target domain. The basic assumption behind transf...
Mingsheng Long, Jianmin Wang 0001, Guiguang Ding, ...
SYNASC
2007
IEEE
136views Algorithms» more  SYNASC 2007»
15 years 7 months ago
Wikipedia-Based Kernels for Text Categorization
In recent years several models have been proposed for text categorization. Within this, one of the widely applied models is the vector space model (VSM), where independence betwee...
Zsolt Minier, Zalan Bodo, Lehel Csató