Profile
International Journal of Computer & Software Engineering Volume 3 (2018), Article ID 3:IJCSE-132, 7 pages
https://doi.org/10.15344/2456-4451/2018/132
Research Article
Non-Negative Paratuck2 Tensor Decomposition Combined to LSTM Network for Smart Contracts Profiling

Jeremy Charlier* and Radu State

SEDAN, University of Luxembourg, 29 Avenue J.F Kennedy, L-1855, Luxembourg, Luxembourg
Jeremy Charlier, SEDAN, University of Luxembourg, 29 Avenue J.F Kennedy, L-1855, Luxembourg, Luxembourg; E-mail: jeremy.charlier@uni.lu
15 February 2018; 05 April 2018; 07 April 2018
Charlier J, State R (2018) Non-Negative Paratuck2 Tensor Decomposition Combined to LSTM Network for Smart Contracts Profiling. Int J Comput Softw Eng 3: 132. doi: https://doi.org/10.15344/2456-4451/2018/132

References

  1. Helms K (2017) Indias government seeks public comments on how bitcoin should be regulated. Bitcoin News. View
  2. Woolf N (2016) Why the US government wants to bring cryptocurrency out of the shadows. The Guardian. View
  3. Rees T (2017) Regulating bitcoin: how new frameworks could be a catalyst for cryptocurrencies. The Telegraph. View
  4. Harshman RA (1970) Foundations of the parafac procedure: models and conditions for an” explanatory” multimodal factor analysis. View
  5. Carroll JD, Chang JJ (1970) Analysis of individual differences in multidimensional scaling via an n-way generalization of eckart-young decomposition. Psychometrika, 35: 283-319. View
  6. Harshman RA (1978) Models for analysis of asymmetrical relationships among n objects or stimuli. In Paper presented at the First Joint Meeting of the Psychometric Society and the Society for Mathematical Psychology, Hamilton, Ontario.
  7. Harshman RA, Lundy ME (1992) Three-way dedicom: Analyzing multiple matrices of asymmetric relationships. In Annual Meeting of the North American Psychometric Society.
  8. Bader BW, Harshman RA, Kolda TG (2007) Temporal analysis of semantic graphs using ASALSAN. Seventh IEEE International Conference. View
  9. Harshman RA, Lundy ME (1996) Uniqueness proof for a family of models sharing features of tucker’s three-mode factor analysis and parafac/ candecomp. Psychometrika 61: 133-154. View
  10. Bro R (2012) Multi-way analysis in the food industry: models, algorithms, and applications. View
  11. Kibangou A, Favier G (2007) Blind joint identification and equalization of wiener-hammerstein communication channels using paratuck- 2 tensor decomposition. In Signal Processing Conference, 15th European. View
  12. Rui W, Sheng RG, Yang Z, Peng X (2016) A novel semi-blind receiver algorithm based on paratuck2 model in mimo relay communication system. International Journal of Future Computer and Communication 5: 214. View
  13. Hochreiter S, Schmidhuber J (1997) Long short-term memory. Neural computation 9: 1735-1780.
  14. Cho K, Merrienboer BV, Gulcehre C, Bahdanau D, Bougares F, et al. (2014) Learning phrase representations using rnn encoder-decoder for statistical machine translation. arXiv preprint arXiv. View
  15. Malhotra P, Vig L, Shroff G, Agarwal P (2015) Long short term memory networks for anomaly detection in time series. View
  16. Greff K, Srivastava RK, Koutnik J, Steunebrink BR, Schmidhuber J, et al. (2017) Lstm: A search space odyssey. IEEE transactions on neural networks and learning systems. View
  17. Alahi A, Goel K, Ramanathan V, Robicquet A, Fei-Fei L, et al. (2016) Social lstm: Human trajectory prediction in crowded spaces. View
  18. Kolda TG, Bader BW (2009) Tensor decompositions and applications. SIAM review 51: 455-500. View
  19. Lee DD, Seung HS (1999) Learning the parts of objects by non-negative matrix factorization. Nature 401: 788-791. View
  20. Sak H, Senior A, Beaufays F (2014) Long short-term memory recurrent neural network architectures for large scale acoustic modeling. View
  21. Gers FA, Schmidhuber J, Cummins F (1999) Learning to forget: Continual prediction with lstm. View
  22. Chollet F (2015) Keras. View