1913 search results - page 114 / 383 » Using Data Mining in MURA Graphic Problems |
152
Voted
KDD
2006
ACM
16 years 4 months ago
2006
ACM
In this paper, we propose a novel probabilistic approach to summarize frequent itemset patterns. Such techniques are useful for summarization, post-processing, and end-user interp...
134
Voted
ICDM
2009
IEEE
15 years 10 months ago
2009
IEEE
—Identification of nodes relevant to a given node in a relational network is a basic problem in network analysis with great practical importance. Most existing network analysis ...
126
click to vote
KDD
2009
ACM
16 years 4 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...
130
Voted
KDD
1997
ACM
15 years 8 months ago
1997
ACM
One of the important problems in data mining is the evaluation of subjective interestingness of the discovered rules. Past research has found that in many real-life applications i...
156
Voted
SDM
2011
SIAM
14 years 6 months ago
2011
SIAM
Identifying the extremal (minimal and maximal) sets from a collection of sets is an important subproblem in the areas of data-mining and satisfiability checking. For example, ext...