4560 search results - page 20 / 912 » Finding Data in the Neighborhood |
ADBIS
2003
Springer
14 years 1 months ago
2003
Springer
Recent research has shown the integration of multiple classifiers to be one of the most important directions in machine learning and data mining. It was shown that, for an ensemble...
COLT
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. The regularization functional induced by the graph Laplacian of a random neighborhood graph based on the data is adaptive in two ways. First it adapts to an underlying ma...
KDD
2005
ACM
14 years 8 months ago
2005
ACM
SIGMOD
2010
ACM
14 years 17 days ago
2010
ACM
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
PKDD
2001
Springer
14 years 5 days ago
2001
Springer