Schvaneveldt, R.W. Pathfinder Associative Networks: Studies in Knowledge Organization. Norwood. Ablex Publishing, NJ, 1990.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....scale (from highly to least related) We are developing a web based system that will allow us to collect the relatedness ratings online thereby making the data collection accessible to a wider audience, and available at any time. With the relatedness ratings, we will use the PathFinder algorithm [21] to construct the expert s concept map. This uses the relatedness rating to assign a weight to the connection between two concepts. These relatedness rating allow us to build the concept map, but they also provide alternate ways in which to compare the novice concept map to that of the expert. ....

Schvaneveldt, R. PathFinder Associative Networks: Studies in Knowledge Organization, Albex: Norwood, NJ, 1990.

....network. The number of links in a network can be reduced by increasing the value of parameter r or q. The geodesic distance between two nodes in a network is the length of the minimum cost path connecting the nodes. A minimumcost network (MCN) PFNET(r= q=n 1) has the least number of links. See [3, 28] for further details. Figure 5 is a Pathfinder network solution of the author co citation matrix described earlier in our MST example. Red circles highlight the additional links with reference to the MST solution. A total of 398 links are included in the network the pathfinder network contains ....

Schvaneveldt, R.W. (ed.), Pathfinder Associative Networks: Studies in Knowledge Organization. Ablex Publishing Corporations, Norwood, New Jersey, 1990.

....links to online documents (text, images, video, software demonstrations, etc. collected from bookmark lists created by SLIS faculty. Using data mining techniques such as Latent Semantic Analysis (Landauer et al. 1998) and information visualization techniques such as Pathfinder Network Scaling (Schvaneveldt, 1990) the links are semantically mined and visualized. 1 The 2 D Web interface will display a 2 D, Starfield Display like map (Ahlberg Shneiderman, 1994) that eases navigation (see Figure 1, right for an example) Users will be able to click on the map in order to teleport into the corresponding ....

Schvaneveldt, R. (Editor) (1990) Pathfinder Associative Networks: Studies in Knowledge Organization. Norwood, NJ: Ablex.

....random and all the participants in that group rated the pairs in that sequence. For the Different Sequence group, the computer generated a different random sequence for each participant. Results The judgements matrices were transformed into network representations using the Pathfinder algorithm (Schvaneveldt, 1990). Pathfinder is a graphtheoretic technique that derives network structures from proximity data. Pathfinder algorithm takes proximity matrices and produces a network in which concepts are Mental Models and Working Memory 13 13 represented as nodes and relations between concepts are represented as ....

Schvaneveldt, R.W. (1990). Pathfinder Associative Networks: Studies in Knowledge Organization. Norwood, NJ: Ablex Publishing.

.... must not be a computer; 2) the analysing program AMME, which extracts the net of the task and user specific processes and calculates different quantitative aspects of the generated net structure; 3) the Petri net simulator PACE (Dhler 1989) and (4) the analysing program KNOT (Interlink 1991; Schvaneveldt 1990). AMME needs two input files: 1. the complete system description on an appropriate level of granularity (the complete state list and the pre post state matrix) and (2. the process description of a specific individual task solving process corresponding to the granularity level of the system ....

Schvaneveldt, R.W. (1990) Pathfinder associative networks - studies in knowledge organization Norwood: Ablex Publishing.

....5 and 6 illustrates how the adjacency scores were created for these prototypes. For each participant, a map and list score were created by correlating the participant s matrix with the appropriate prototype, using the Knot Program (Interlink, 1999) based on Schvaneveldt s Pathfinder approach (Schvaneveldt, 1990). Analysis. A 2 X 2 repeated measures analysis of variance was computed with group (map vs list) as a between subjects independent variable and prototype (map vs list) as a within subjects independent variable. Prototype correlations served as the dependent variable. A main effect for prototype ....

Schvaneveldt, R.W. (1990). Pathfinder associative networks: Studies in knowledge organization. Norwood, NJ.: Ablex Publishing Corp.

.... was developed to model semantic memory in humans and to provide a paradigm for scaling psychological similarity data[62] A number of psychological and design studies have compared PfNets with other scaling techniques and found that they provide a useful tool for revealing conceptual structure[17, 61]. The PfNets representations underlying the system s network displays are minimum cost networks derived from measures of term and document associations. The network of documents is based on interdocument similarity, as measured by co occurrence of keywords between document pairs. For the network ....

Schvaneveldt, R. W. (Ed.), (1990.) Pathfinder associative networks: Studies in knowledge organization. Norwood, NJ: Ablex.

No context found.

Schvaneveldt, R.W. Pathfinder Associative Networks: Studies in Knowledge Organization. Norwood. Ablex Publishing, NJ, 1990.

No context found.

Schvaneveldt, R. W. (Ed.). Pathfinder Associative Networks: Studies in Knowledge Organization. Norwood, NJ: Ablex, 1990.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC