Results 11 to 20 of about 3,592,441 (346)
IEEE AccessBook recommendations are crucial in digital library transformation, enhancing service sophistication and customization. They allow readers to access books tailored to their specific interests.
Yafeng Kong
doaj +2 more sources
Early Childhood Education Papers, 2020 One of the character problems in early childhood is the lack of ability to be responsible, communicate, and cooperate. These three main behaviors are characteristics of leadership behavior.
Sinthia Nurul Fitri, Edi Waluyo
doaj +3 more sources
A graph neural network recommendation algorithm based on multi-scale attention and contrastive learning [PDF]
Scientific ReportsWhen facing sparse user–item interaction data, recommendation systems often struggle to learn high-quality representations, which in turn affects the recommendation performance.
Dongqi Pu +4 more
doaj +2 more sources
The Book Embedding Problem from a SAT-Solving Perspective
International Symposium Graph Drawing and Network Visualization, 2015 Michael A. Bekos +2 more
openalex +2 more sources
Book Review: Embeddings in manifolds [PDF]
Bulletin of the American Mathematical Society, 2011 J. W. Cannon
openalex +4 more sources
‘A device for being able to book P&L’: The organizational embedding of the Gaussian copula [PDF]
Social Studies of Science, 2014 Donald MacKenzie, Taylor Spears
openalex +2 more sources
Realised Volatility Forecasting: Machine Learning via Financial Word Embedding [PDF]
Social Science Research Network, 2021 We develop FinText, a novel, state-of-the-art, financial word embedding from Dow Jones Newswires Text News Feed Database. Incorporating this word embedding in a machine learning model produces a substantial increase in volatility forecasting performance ...
Eghbal Rahimikia, Stefan Zohren, S. Poon
semanticscholar +1 more source
Book Embeddings of Graph Products
, 2020 A $k$-stack layout (also called a $k$-page book embedding) of a graph consists of a total order of the vertices, and a partition of the edges into $k$ sets of non-crossing edges with respect to the vertex order. The stack number (book thickness, page number) of a graph is the minimum $k$ such that it admits a $k$-stack layout.
Sergey Pupyrev
openalex +4 more sources