Sciweavers

4560 search results - page 330 / 912
» Finding Data in the Neighborhood
Sort
View
CORR
2004
Springer
152views Education» more  CORR 2004»
15 years 6 months ago
Non-negative matrix factorization with sparseness constraints
Non-negative matrix factorization (NMF) is a recently developed technique for finding parts-based, linear representations of non-negative data. Although it has successfully been a...
Patrik O. Hoyer
SOCIALCOM
2010
15 years 4 months ago
Measuring Similarity between Sets of Overlapping Clusters
The typical task of unsupervised learning is to organize data, for example into clusters, typically disjoint clusters (eg. the K-means algorithm). One would expect (for example) a...
Mark K. Goldberg, Mykola Hayvanovych, Malik Magdon...
ICCV
2007
IEEE
16 years 8 months ago
High-Dimensional Feature Matching: Employing the Concept of Meaningful Nearest Neighbors
Matching of high-dimensional features using nearest neighbors search is an important part of image matching methods which are based on local invariant features. In this work we hi...
Dusan Omercevic, Ondrej Drbohlav, Ales Leonardis
179
Voted
ICIP
2008
IEEE
16 years 8 months ago
Automatic liver tumor diagnosis with Dynamic-Contrast Enhanced MRI
Dynamic-Contrast Enhanced MRI (DCE-MRI) is currently used as a complementary diagnosis tool to assess the malignancy of the liver tumor, called hepatoma, hepatocarcinoma, hepatoce...
Liliana Caldeira, Isabela Silva, João Sanch...
ICDE
2008
IEEE
150views Database» more  ICDE 2008»
16 years 8 months ago
Link Privacy in Social Networks
We consider a privacy threat to a social network in which the goal of an attacker is to obtain knowledge of a significant fraction of the links in the network. We formalize the ty...
Aleksandra Korolova, Rajeev Motwani, Shubha U. Nab...