[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
10.1145/3055635.3056586acmotherconferencesArticle/Chapter ViewAbstractPublication PagesicmlcConference Proceedingsconference-collections
research-article

Multidimensional Unfolding Based on Stochastic Neighbor Relationship

Published: 24 February 2017 Publication History

Abstract

Multi-dimensional Unfolding (MU) is a method to visualize relevance data between two sets (e.g., preference data) as a single scatter plot. Usually, in the analysis of relevance data, users are interested in which elements are strongly related to each other (e.g., how much an individual likes an item), and not in which elements are irrelevant to each other. However, the conventional MU often suffers from the problem that relationships between irrelevant pairs are overly emphasized and those between relevant pairs are not represented appropriately. Here we propose novel MU methods based on stochastic neighbor relationship, by extending dimensionality reduction methods, Stochastic Neighbor Embed- ding (SNE) and t-distributed SNE. The proposed methods are defined by Kullback-Leibler divergence (KL divergence), and because of the asymmetric property of KL divergence, they give priority to representing relationships between relevant pairs. Experimental results show that the proposed methods can alleviate the problem and achieve reasonable visualization compared to the conventional MU.

References

[1]
M.C. Ferreira de Oliveira and H. Levkowitz. 2003. From visual data exploration to visual data mining: A survey. IEEE Transactions on Visualization and Computer Graphics, 9(3):378--394
[2]
J. A. Lee and M. Verleysen. 2007. Nonlinear dimensionality reduction. Springer, New York, NY, USA
[3]
L.J.P. van der Maaten, E.O. Postma, and H.J. van den Herik. 2009. Dimensionality Reduction: A Comparative Review. Tilburg University Technical Report, TiCC-TR 2009-005
[4]
M. J. Greenacre and M. W. Browne. 1986. An efficient alternating least-squares algorithm to perform multidimensional unfolding. Psychometrika, 51, 241--250
[5]
I. Borg and P. J.F. Groenen. 2005. Modern Multidimensional Scaling - Theory and Applications. NY Springer.
[6]
F. M. T. A. Busing, P. J. K. Groenen and W. J. Heiser. 2005. Avoiding degeneracy in multidimensional unfolding by penalizing on the coefficient of variation. Psychometrika, 70, 71--98
[7]
G. E. Hinton and S. T. Roweis. 2002. Stochastic neighbor embedding. Advances in neural information processing systems, 833--840
[8]
L. Maaten and G. E. Hinton. 2008. Visualizing Data using t-SNE. Journal of Machine Learning Research, 9, 2579--2605
[9]
B. J. Frey and R. Patrascul and T. S. Jaakkola and J. Moran. 2000. Sequentially fitting "inclusive " trees for inference in noisy-OR networks.
[10]
T. Minka. 2005. Divergence measures and message passing. Technical report, Microsoft Research
[11]
M. Vladymyrov, M. Á. Carreira-Perpiñán. 2013. Entropic Affinities: Properties and Efficient Numerical Computation. Proceedings of The 30th International Conference on Machine Learning, pp. 477--485.
[12]
K. Adachi. 2000. A Random Effect Model in Metric Multidimensional Unfolding. The Japanese Journal of Behaviormetrics Vol.27, No.1, pp. 12--23 (in Japanese).
[13]
D. M. Blei et al. 2003. Latent Dirichlet Allocation. Journal of Machine Learning Research, 3, 993--1022

Cited By

View all
  • (2018)Dyad ranking using Plackett---Luce models based on joint feature representationsMachine Language10.1007/s10994-017-5694-9107:5(903-941)Online publication date: 1-May-2018

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Other conferences
ICMLC '17: Proceedings of the 9th International Conference on Machine Learning and Computing
February 2017
545 pages
ISBN:9781450348171
DOI:10.1145/3055635
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

In-Cooperation

  • Southwest Jiaotong University

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 24 February 2017

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. Multi-dimensional Unfolding
  2. Stochastic Neighbor Embedding
  3. Unsupervised learning
  4. Visualization
  5. t-Distributed Stochastic Neighbor Embedding

Qualifiers

  • Research-article
  • Research
  • Refereed limited

Conference

ICMLC 2017

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)1
  • Downloads (Last 6 weeks)0
Reflects downloads up to 19 Dec 2024

Other Metrics

Citations

Cited By

View all
  • (2018)Dyad ranking using Plackett---Luce models based on joint feature representationsMachine Language10.1007/s10994-017-5694-9107:5(903-941)Online publication date: 1-May-2018

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media