Clustering using non-negative matrix factorization on sparse graphs

Invention Grant

US09727532B2 Clustering using non-negative matrix factorization on sparse graphs 有权

Please log in to see more content

Patent Title: Clustering using non-negative matrix factorization on sparse graphs
Application No.: US12109496

Application Date: 2008-04-25
Publication No.: US09727532B2

Publication Date: 2017-08-08
Inventor: Florent Perronnin , Guillaume Bouchard
Applicant: Florent Perronnin , Guillaume Bouchard
Applicant Address: US CT Norwalk
Assignee: XEROX CORPORATION
Current Assignee: XEROX CORPORATION
Current Assignee Address: US CT Norwalk
Agency: Fay Sharpe LLP
Main IPC: G06F17/30
IPC: G06F17/30 ; G06F17/16 ; G06K9/62

Clustering using non-negative matrix factorization on sparse graphs

Abstract:

Object clustering techniques are disclosed. A nonnegative sparse similarity matrix is constructed for a set of objects. Nonnegative factorization of the nonnegative sparse similarity matrix is performed. Objects of the set of objects are allocated to clusters based on factor matrices generated by the nonnegative factorization of the nonnegative sparse similarity matrix.

Public/Granted literature

US20090271433A1 CLUSTERING USING NON-NEGATIVE MATRIX FACTORIZATION ON SPARSE GRAPHS Public/Granted day:2009-10-29

Information query

Espacenet