Scott Payne
Biographic Data
| ID | 3873087 |
|---|---|
| NAME | Scott Payne |
| GIVEN NAMES | Scott |
| FAMILY NAME | Payne |
| SIGNATURE | PAYNE S |
| AFFILIATIONS | American College Testing |
| ORCID | 0000-0001-5717-6670 |
| VERIFIED | Yes |
| TOTAL WORKS | 2 |
| TOTAL CITATIONS | 0 |
| AUTHOR COUNT | 2 |
| EDITOR COUNT | 0 |
| FIRST PUBLICATION YEAR | 2020 |
| LATEST PUBLICATION YEAR | 2021 |
| H-INDEX | 0 |
Diffusion profile embedding as a basis for graph vertex similarity
We describe here a notion of diffusion similarity , a method for defining similarity between vertices in a given graph using the properties of random walks on the graph to model the relationships between vertices. Using the approach of graph vertex embedding, we characterize a vertex v i by considering two types of diffusion patterns: the ways in which random walks emanate from the vertex v i to the remaining graph and how they converge to the ve…
Gaming alone or together? L2 beginner-level gaming practices
Games are seen as beneficial for language learning because they facilitate rich, authentic communication, and promote collaborative practices which are effective for language learning. However, most of the studies to date investigating games for L2 learning have focused on intermediate or advanced learners, and we know very little of how games can be best utilized with beginner-level learners. This study investigates beginner-level learners of Sp…
No prominent works on this page.
Gaming alone or together? L2 beginner-level gaming practices
Games are seen as beneficial for language learning because they facilitate rich, authentic communication, and promote collaborative practices which are effective for language learning. However, most of the studies to date investigating games for L2 learning have focused on intermediate or advanced learners, and we know very little of how games can be best utilized with beginner-level learners. This study investigates beginner-level learners of Sp…
Diffusion profile embedding as a basis for graph vertex similarity
We describe here a notion of diffusion similarity , a method for defining similarity between vertices in a given graph using the properties of random walks on the graph to model the relationships between vertices. Using the approach of graph vertex embedding, we characterize a vertex v i by considering two types of diffusion patterns: the ways in which random walks emanate from the vertex v i to the remaining graph and how they converge to the ve…
Computer Science (2 works) · Artificial Intelligence (1 works) · Bipartite graph (1 works) · Cluster analysis (1 works) · Combinatorics (1 works) · Complex Network Analysis Techniques (1 works) · Cosine similarity (1 works) · Discrete mathematics (1 works) · EFL/ESL Teaching and Learning (1 works) · Embedding (1 works)