3651 search results - page 388 / 731 » Data Mining for Security Applications |
178
click to vote
ICDM
2007
IEEE
16 years 1 months ago
2007
IEEE
Learning communities from a graph is an important problem in many domains. Different types of communities can be generalized as link-pattern based communities. In this paper, we p...
157
click to vote
ICDM
2005
IEEE
16 years 9 days ago
2005
IEEE
Many practical applications require that distance measures to be asymmetric and context-sensitive. We introduce Context-sensitive Learnable Asymmetric Dissimilarity (CLAD) measure...
158
click to vote
ICDM
2005
IEEE
16 years 9 days ago
2005
IEEE
In this paper, we propose a text representation model, Tensor Space Model (TSM), which models the text by multilinear algebraic high-order tensor instead of the traditional vector...
176
click to vote
PAKDD
2004
ACM
16 years 2 days ago
2004
ACM
This paper proposes a two-step graph partitioning method to discover constrained clusters with an objective function that follows the well-known minmax clustering principle. Compar...
143
click to vote
ICDM
2003
IEEE
16 years 1 hour ago
2003
IEEE
In knowledge discovery applications, where new features are to be added, an acquisition policy can help select the features to be acquired based on their relevance and the cost of...