Sciweavers

3894 search results - page 604 / 779
» Approximation Algorithms for Biclustering Problems
Sort
View
126
Voted
ESWS
2010
Springer
15 years 8 months ago
Leveraging Terminological Structure for Object Reconciliation
Abstract. It has been argued that linked open data is the major benefit of semantic technologies for the web as it provides a huge amount of structured data that can be accessed i...
Jan Noessner, Mathias Niepert, Christian Meilicke,...
133
Voted
AAAI
2010
15 years 5 months ago
Multi-Instance Dimensionality Reduction
Multi-instance learning deals with problems that treat bags of instances as training examples. In single-instance learning problems, dimensionality reduction is an essential step ...
Yu-Yin Sun, Michael K. Ng, Zhi-Hua Zhou
124
Voted
EOR
2006
73views more  EOR 2006»
15 years 3 months ago
Path relinking and GRG for artificial neural networks
Artificial neural networks (ANN) have been widely used for both classification and prediction. This paper is focused on the prediction problem in which an unknown function is appr...
Abdellah El-Fallahi, Rafael Martí, Leon S. ...
106
Voted
IPL
2008
89views more  IPL 2008»
15 years 3 months ago
On the tractability of coloring semirandom graphs
As part of the efforts put in understanding the intricacies of the k-colorability problem, different distributions over k-colorable graphs were analyzed. While the problem is notor...
Julia Böttcher, Dan Vilenchik
145
Voted
IPL
2007
96views more  IPL 2007»
15 years 3 months ago
On constructing an optimal consensus clustering from multiple clusterings
Computing a suitable measure of consensus among several clusterings on the same data is an important problem that arises in several areas such as computational biology and data mi...
Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao, Jie...