Sciweavers

138 search results - page 6 / 28
» Information Theoretic Clustering of Sparse Co-Occurrence Dat...
Sort
View
DATESO
2004
165views Database» more  DATESO 2004»
13 years 9 months ago
Multi-dimensional Sparse Matrix Storage
Large sparse matrices play important role in many modern information retrieval methods. These methods, such as clustering, latent semantic indexing, performs huge number of computa...
Jiri Dvorský, Michal Krátký
ICPR
2006
IEEE
14 years 8 months ago
Learning Wormholes for Sparsely Labelled Clustering
Distance functions are an important component in many learning applications. However, the correct function is context dependent, therefore it is advantageous to learn a distance f...
Eng-Jon Ong, Richard Bowden
CORR
2008
Springer
98views Education» more  CORR 2008»
13 years 7 months ago
An Information-Theoretical View of Network-Aware Malware Attacks
This work investigates three aspects: (a) a network vulnerability as the non-uniform vulnerable-host distribution, (b) threats, i.e., intelligent malwares that exploit such a vulne...
Zesheng Chen, Chuanyi Ji
DATAMINE
1999
140views more  DATAMINE 1999»
13 years 7 months ago
A Scalable Parallel Algorithm for Self-Organizing Maps with Applications to Sparse Data Mining Problems
Abstract. We describe a scalable parallel implementation of the self organizing map (SOM) suitable for datamining applications involving clustering or segmentation against large da...
Richard D. Lawrence, George S. Almasi, Holly E. Ru...
ACL
1993
13 years 9 months ago
Contextual Word Similarity and Estimation from Sparse Data
In recent years there is much interest in word cooccurrence relations, such as n-grams, verb-object combinations, or cooccurrence within a limited context. This paper discusses ho...
Ido Dagan, Shaul Marcus, Shaul Markovitch