11371 search results - page 1994 / 2275 » The network inhibition problem |
166
click to vote
KDD
2009
ACM
16 years 7 months ago
2009
ACM
Algorithms based on simulating stochastic flows are a simple and natural solution for the problem of clustering graphs, but their widespread use has been hampered by their lack of...
154
click to vote
KDD
2007
ACM
16 years 7 months ago
2007
ACM
How can we find communities in dynamic networks of social interactions, such as who calls whom, who emails whom, or who sells to whom? How can we spot discontinuity timepoints in ...
191
click to vote
KDD
2005
ACM
16 years 7 months ago
2005
ACM
The problem of finding frequent patterns from graph-based datasets is an important one that finds applications in drug discovery, protein structure analysis, XML querying, and soc...
175
click to vote
KDD
2003
ACM
16 years 7 months ago
2003
ACM
Recent proposals to apply data mining systems to problems in law enforcement, national security, and fraud detection have attracted both media attention and technical critiques of...
166
click to vote
KDD
2002
ACM
16 years 7 months ago
2002
ACM
An adaptive semi-supervised ensemble method, ASSEMBLE, is proposed that constructs classification ensembles based on both labeled and unlabeled data. ASSEMBLE alternates between a...