2512 search results - page 209 / 503 » Learning from Highly Structured Data by Decomposition |
168
click to vote
BMCBI
2011
14 years 8 months ago
2011
Background: The search for cluster structure in microarray datasets is a base problem for the so-called “-omic sciences”. A difficult problem in clustering is how to handle da...
124
click to vote
IMC
2005
ACM
15 years 10 months ago
2005
ACM
Network “telescopes” that record packets sent to unused blocks of Internet address space have emerged as an important tool for observing Internet-scale events such as the spre...
138
click to vote
ISVC
2007
Springer
15 years 10 months ago
2007
Springer
Many computer graphics rendering algorithms and techniques use ray tracing for generation of natural and photo-realistic images. The efficiency of the ray tracing algorithms depend...
155
click to vote
ASC
2008
15 years 4 months ago
2008
Most data mining algorithms assume static behavior of the incoming data. In the real world, the situation is different and most continuously collected data streams are generated by...
129
click to vote
ICML
2002
IEEE
16 years 5 months ago
2002
IEEE
This paper addresses cost-sensitive classification in the setting where there are costs for measuring each attribute as well as costs for misclassification errors. We show how to ...