Sciweavers

1601 search results - page 205 / 321
» Closed Sets for Labeled Data
Sort
View
DATASCIENCE
2006
110views more  DATASCIENCE 2006»
15 years 6 months ago
Towards development of a high quality public domain global roads database
There is clear demand for a global spatial public domain roads data set with improved geographic and temporal coverage, consistent coding of road types, and clear documentation of...
Andrew Nelson 0002, Alexander de Sherbinin, France...
AIRWEB
2008
Springer
15 years 8 months ago
Robust PageRank and locally computable spam detection features
Since the link structure of the web is an important element in ranking systems on search engines, web spammers widely use the link structure of the web to increase the rank of the...
Reid Andersen, Christian Borgs, Jennifer T. Chayes...
COCOON
2010
Springer
15 years 11 months ago
Clustering with or without the Approximation
We study algorithms for clustering data that were recently proposed by Balcan, Blum and Gupta in SODA’09 [4] and that have already given rise to two follow-up papers. The input f...
Frans Schalekamp, Michael Yu, Anke van Zuylen
BMCBI
2008
157views more  BMCBI 2008»
15 years 6 months ago
Dimension reduction with redundant gene elimination for tumor classification
Background: Analysis of gene expression data for tumor classification is an important application of bioinformatics methods. But it is hard to analyse gene expression data from DN...
Xue-Qiang Zeng, Guo-Zheng Li, Jack Y. Yang, Mary Q...
ICASSP
2011
IEEE
14 years 10 months ago
Co-clustering as multilinear decomposition with sparse latent factors
The K-means clustering problem seeks to partition the columns of a data matrix in subsets, such that columns in the same subset are ‘close’ to each other. The co-clustering pr...
Evangelos E. Papalexakis, Nicholas D. Sidiropoulos