1599 search results - page 150 / 320 » Theoretical Frameworks for Data Mining |
KDD
2009
ACM
15 years 10 months ago
2009
ACM
Search queries are typically very short, which means they are often underspecified or have senses that the user did not think of. A broad latent query aspect is a set of keywords ...
KDD
2003
ACM
15 years 10 months ago
2003
ACM
Dimensionality reduction via Random Projections has attracted considerable attention in recent years. The approach has interesting theoretical underpinnings and offers computation...
PAKDD
2009
ACM
15 years 4 months ago
2009
ACM
Many applications of social networks require relationship anonymity due to the sensitive, stigmatizing, or confidential nature of relationship. Recent work showed that the simple ...
SISAP
2008
IEEE
15 years 4 months ago
2008
IEEE
Distance permutation indexes support fast proximity searching in high-dimensional metric spaces. Given some fixed reference sites, for each point in a database the index stores a...
ICDM
2007
IEEE
15 years 4 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...