3994 search results - page 774 / 799 » A Linear Logical Framework |
138
click to vote
KDD
2008
ACM
16 years 6 days ago
2008
ACM
The success of popular algorithms such as k-means clustering or nearest neighbor searches depend on the assumption that the underlying distance functions reflect domain-specific n...
122
click to vote
KDD
2007
ACM
16 years 6 days ago
2007
ACM
A good distance metric is crucial for many data mining tasks. To learn a metric in the unsupervised setting, most metric learning algorithms project observed data to a lowdimensio...
114
click to vote
KDD
2006
ACM
16 years 6 days 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 ...
104
click to vote
KDD
2004
ACM
16 years 6 days ago
2004
ACM
Essentially all data mining algorithms assume that the datagenerating process is independent of the data miner's activities. However, in many domains, including spam detectio...
192
click to vote
SIGMOD
2008
ACM
15 years 12 months ago
2008
ACM
The problem of simultaneously clustering columns and rows (coclustering) arises in important applications, such as text data mining, microarray analysis, and recommendation system...