Name
Abstract | ||
|---|---|---|
This paper addresses a novel problem when learning similarities. In our problem, an input is given by a long sequence of co-occurrence events among objects, namely a stream of co-occurrence events. Given a stream of co-occurrence events, we learn unknown latent vectors of objects such that their inner product adaptively approximates the target similarities resulting from accumulating co-occurrence events. Toward this end, we propose a new incremental algorithm for dimensionality reduction. The core of our algorithm is its partial updating style where only a small number of latent vectors are modified for each co-occurrence event, while most other latent vectors remain unchanged. Experiment results using both synthetic and real data sets demonstrate that in contrast to some existing methods, the proposed algorithm can stably and gradually learn target similarities among objects without being trapped by the collapsing problem. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1016/j.patrec.2013.08.032 | Pattern Recognition Letters |
Keywords | Field | DocType |
latent vector,unknown latent vector,existing method,co-occurrence event,partial-update dimensionality reduction,experiment result,new incremental algorithm,target similarity,proposed algorithm,dimensionality reduction,co occurrence | Small number,Data mining,Data set,Dimensionality reduction,Pattern recognition,Co-occurrence,Artificial intelligence,Mathematics | Journal |
Volume | ISSN | Citations |
36, | 0167-8655 | 0 |
PageRank | References | Authors |
0.34 | 31 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Seung-Hoon Na | 1 | 298 | 30.67 |
| Jong-Hyeok Lee | 2 | 740 | 97.88 |