155 search results - page 14 / 31 » A parallel, distributed algorithm for relational frequent pa... |
JCB
2002
13 years 7 months ago
2002
For small samples, classi er design algorithms typically suffer from over tting. Given a set of features, a classi er must be designed and its error estimated. For small samples, ...
EUMAS
2006
13 years 9 months ago
2006
We present a general Multi-Agent System framework for distributed data mining based on a Peer-toPeer model. The framework adopts message-based asynchronous communication and a dyn...
BMCBI
2008
13 years 7 months ago
2008
Background: The discovery of biomarkers is an important step towards the development of criteria for early diagnosis of disease status. Recently electrospray ionization (ESI) and ...
CLUSTER
2005
IEEE
14 years 1 months ago
2005
IEEE
The amount of data collected and stored in databases is growing considerably for almost all areas of human activity. Processing this amount of data is very expensive, both humanly...
KDD
2006
ACM
14 years 8 months ago
2006
ACM
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...