5107 search results - page 347 / 1022 » Data Mining and Information Retrieval |
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 ...
170
click to vote
KDD
2002
ACM
16 years 7 months ago
2002
ACM
The 3D conformation of a protein may be compactly represented in a symmetrical, square, boolean matrix of pairwise, inter-residue contacts, or "contact map". The contact...
204
click to vote
ISMIS
1997
Springer
15 years 11 months ago
1997
Springer
e about image features can be expressed as a hierarchical structure called a Type Abstraction Hierarchy (TAH). TAHs can be generated automatically by clustering algorithms based on...
221
click to vote
TIP
2010
15 years 5 months ago
2010
—In increasingly many cases of interest in computer vision and pattern recognition, one is often confronted with the situation where data size is very large. Usually, the labels ...
182
click to vote
SDM
2009
SIAM
16 years 4 months ago
2009
SIAM
Latent Semantic Indexing (LSI) has been validated to be effective on many small scale text collections. However, little evidence has shown its effectiveness on unsampled large sca...