A Structural Representation of Migraine Diagnostic Criteria: The Experts' View

Nash, Justin M.

doi:10.1046/j.1526-4610.2003.03066.x

Cited by 10 publications

(13 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The Pathfinder Scaling Algorithm determines whether two concepts are linked through the triangle inequality (Cooke 1992b, Guerrero-Bote, Zapico-Alonso, Esinosa-Calvo, Gomez-Crisostomo & Moya-Anegon 2006, Nash & Nash 2003. This algorithm has two parameters.…”

Section: How the Pathfinder Algorithm Workmentioning

confidence: 99%

“…This algorithm has two parameters. The parameter r is related to the Minkowski metric which is used for calculating indirect path distances between two concepts, and its value can be between 1 and infinity (Kivlighan & Tibbits 2012, Nash & Nash 2003, Schvaneveldt 1990. While the city block metric is computed when r is equal to 1, the length of an indirect path equals the maximum weight of the links that create the path when r is set as infinity, (Cooke 1992b, Nash & Nash 2003.…”

Section: How the Pathfinder Algorithm Workmentioning

confidence: 99%

“…The parameter r is related to the Minkowski metric which is used for calculating indirect path distances between two concepts, and its value can be between 1 and infinity (Kivlighan & Tibbits 2012, Nash & Nash 2003, Schvaneveldt 1990. While the city block metric is computed when r is equal to 1, the length of an indirect path equals the maximum weight of the links that create the path when r is set as infinity, (Cooke 1992b, Nash & Nash 2003. The other parameter, q, determines the maximum number of links in examining any path, and this parameter could be set from 1 to the number of nodes minus one (Cooke 1992b, Kivlighan & Tibbits 2012, Nash & Nash 2003, Schvaneveldt 1990).…”

Section: How the Pathfinder Algorithm Workmentioning

confidence: 99%

“…While the city block metric is computed when r is equal to 1, the length of an indirect path equals the maximum weight of the links that create the path when r is set as infinity, (Cooke 1992b, Nash & Nash 2003. The other parameter, q, determines the maximum number of links in examining any path, and this parameter could be set from 1 to the number of nodes minus one (Cooke 1992b, Kivlighan & Tibbits 2012, Nash & Nash 2003, Schvaneveldt 1990). After both parameters are set, two concepts are assigned to be linked if the length of any indirect path is equal to or longer than the length of the link between these two concepts (Nash & Nash 2003).…”

Section: How the Pathfinder Algorithm Workmentioning

confidence: 99%

“…The other parameter, q, determines the maximum number of links in examining any path, and this parameter could be set from 1 to the number of nodes minus one (Cooke 1992b, Kivlighan & Tibbits 2012, Nash & Nash 2003, Schvaneveldt 1990). After both parameters are set, two concepts are assigned to be linked if the length of any indirect path is equal to or longer than the length of the link between these two concepts (Nash & Nash 2003).…”

Section: How the Pathfinder Algorithm Workmentioning

confidence: 99%

See 4 more Smart Citations

Exploring the Mobile Structural Assessment Tool: Concept Maps for Learning Website

Filiz

Trumpower

Vanapalli

2014

Rev. colomb. estad.

View full text Add to dashboard Cite

In this paper, we describe how the pathfinder algorithm converts relatedness ratings of concept pairs to concept maps; we also present how this algorithm has been used to develop the Concept Maps for Learning website (www.conceptmapsforlearning.com) based on the principles of effective formative assessment. The pathfinder networks, one of the network representation tools, claim to help more students memorize and recall the relations between concepts than spatial representation tools (such as MultiDimensional Scaling). Therefore, the pathfinder networks have been used in various studies on knowledge structures, including identifying students' misconceptions. To accomplish this, each student's knowledge map and the expert knowledge map are compared via the pathfinder software, and the differences between these maps are highlighted. After misconceptions are identified, the pathfinder software fails to provide any feedback on these misconceptions. To overcome this weakness, we have been developing a mobile-based concept mapping tool providing visual, textual and remedial feedback (ex. videos, website links and applets) on the concept relations. This information is then placed on the expert concept map, but not on the student's concept map. Additionally, students are asked to note what they understand from given feedback, and given the opportunity to revise their knowledge maps after receiving various types of feedback. ResumenEn este artículo se describe cómo el algoritmo de búsqueda de ruta convierte puntajes de conceptos pareados en mapas conceptuales. También se presenta cómo este algoritmo ha sido utilizado para desarrollar estos mapas conceptuales para aprendizaje (www.conceptmapsforlearning.com) basados en los principios del aseguramiento formativo efectivo.Las redes de búsqueda de ruta, una de las herramientas de representación de redes, ayudan a memorizar a los estudiantes y enunciar las relaciones entre mapas más que las herramientas de expresión espacial (tales como el escalonamiento multidimensional). Por tanto, las redes de búsqueda de rutas han sido usadas en varios estudios de estructura del conocimiento incluyendo la identificación de malos conceptos usados por los estudiantes. Para lograr esto, cada mapa de conocimiento tanto del estudiante como del experto son comparados vía el software de búsqueda de ruta y se remarcan las diferencias entre éstos. Después que los malos conceptos son identificados, el software de búsqueda falla en entregar una retroalimentación en estos nodos conceptuales. Para superar esta debilidad, se desarrolla una herramienta de mapa conceptual móvil que manda retroalimentaciones visuales, textuales y remediales (e.g. vídeos, enlaces a páginas web y applets) en las relaciones de los conceptos. Adicionalmente, los estudiantes son preguntados acerca de qué entienden de la retroalimentación brindada y se les da la oportunidad de revisar sus mapas de conocimiento después de recibir varios tipos de retroalimentación.Palabras clave: aseguramiento estructural, mapas conceptua...

show abstract

Section: How the Pathfinder Algorithm Workmentioning

confidence: 99%

Section: How the Pathfinder Algorithm Workmentioning

confidence: 99%

Section: How the Pathfinder Algorithm Workmentioning

confidence: 99%

Section: How the Pathfinder Algorithm Workmentioning

confidence: 99%

Section: How the Pathfinder Algorithm Workmentioning

confidence: 99%

See 3 more Smart Citations

Exploring the Mobile Structural Assessment Tool: Concept Maps for Learning Website

Filiz

Trumpower

Vanapalli

2014

Rev. colomb. estad.

View full text Add to dashboard Cite

show abstract

Brand personality, self‐congruity, and preference: A knowledge structures approach

Branaghan

Hildebrand

2011

J of Consumer Behaviour

View full text Add to dashboard Cite

Using the construct of brand personality to measure automobile and soft drink personalities, two studies represented self-congruity by combining brands and the self-image into Pathfinder associative networks (Schvaneveldt et al., 1989). Self-congruity, the number of links between the self and each brand, was predictive of preference and ideal brand. Because brand personality and self-image are knowledge structures, and facets of brand personality also describe the self, self-congruity can be represented and measured in networks. This approach could be helpful to marketers studying how the self is related to each brand and how brands interrelate.

show abstract

Is the Comparator in Your Diagnostic Cost-Effectiveness Model “Standard of Care”? Recommendations from Literature Reviews and Expert Interviews on How to Identify and Operationalize It

Graziadio,

Gregg,

Allen

et al. 2024

Value in Health

View full text Add to dashboard Cite

A Structural Representation of Migraine Diagnostic Criteria: The Experts' View

Abstract: The structural representation of migraine diagnostic criteria from these international headache experts is consistent with the migraine diagnostic criteria set forth in the IHS classification system and thus provides further support for the validity of migraine criteria in the IHS system.

Cited by 10 publications

References 31 publications

Exploring the Mobile Structural Assessment Tool: Concept Maps for Learning Website

Exploring the Mobile Structural Assessment Tool: Concept Maps for Learning Website

Brand personality, self‐congruity, and preference: A knowledge structures approach

Is the Comparator in Your Diagnostic Cost-Effectiveness Model “Standard of Care”? Recommendations from Literature Reviews and Expert Interviews on How to Identify and Operationalize It

Contact Info

Product

Resources

About