4930 search results - page 897 / 986 » Testing a Safety-Critical Application |
194
click to vote
KDD
2006
ACM
16 years 6 months ago
2006
ACM
Order-preserving submatrixes (OPSMs) have been accepted as a biologically meaningful subspace cluster model, capturing the general tendency of gene expressions across a subset of ...
190
click to vote
KDD
2006
ACM
16 years 6 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.)...
169
click to vote
KDD
2006
ACM
16 years 6 months ago
2006
ACM
We describe a data mining system to detect frauds that are camouflaged to look like normal activities in domains with high number of known relationships. Examples include accounti...
185
click to vote
KDD
2005
ACM
16 years 6 months ago
2005
ACM
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...
172
click to vote
KDD
2003
ACM
16 years 6 months ago
2003
ACM
A number of medically important disease-causing bacteria (collectively called Gram-negative bacteria) are noted for the extra "outer" membrane that surrounds their cell....