You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
New Excel output (close#6), update README, tweak UI (e.g. mouse-overs)
* Excel output: added table with raw matching score, i.e. without constructs
reversal, to better resemble step 3 from method description
* Update README with parts from the JOSS paper as suggested by reviewers
* UI Tweaks to improve usability: info box informs that the output is an
Excel file, mouser-over for most analysis settings
* Added MIT License
vertex_font_pole_1<-1#recode(vertex_relations, "neg"= 2, .default = 1) # can be left out for now but kept as a reminder comment for an alternative approach
692
+
vertex_font_pole_2<-2# recode(vertex_relations, "neg"= 1, .default = 2) # can be left out for now but kept as a reminder comment for an alternative approach
Copy file name to clipboardExpand all lines: README.md
+30-1Lines changed: 30 additions & 1 deletion
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -10,11 +10,31 @@ This package implements the [Interpretive Clustering (IC)](https://doi.org/10.10
10
10
method as described in [Burr, King, and Heckmann (2020)](https://doi.org/10.1080/14780887.2020.1794088).
11
11
An introduction to the software is available on [YouTube](https://youtu.be/f9oINYA22Rc).
12
12
Interpretive Clustering is a variant of construct clustering for [repertory grid](https://en.wikipedia.org/wiki/Repertory_grid)
13
-
data. While derived from theoretical considerations based on [Personal Construct Theory](https://en.wikipedia.org/wiki/Personal_construct_theory), the procedure itself is mathematically equivalent to a problem from graph theory called [maximal cliques enumeration](https://en.wikipedia.org/wiki/Clique_problem#Listing_all_maximal_cliques). Given a similarity measure, in our case the number of matching scores between two constructs, a network graph of relatedness between constructs is construed. A clique is a group of constructs which are all mutually related, given some cut-off criterion for relatedness (e.g. 6 matching scores in a grid with 7 elements). While an offline approach is also described to find the construct cliques, this software automates the process. Below you see the resulting cliques for Sylvia's sample grid. In the paper, the interpretation of the discovered cliques is discussed in detail.
13
+
data. While derived from theoretical considerations based on [Personal Construct Theory](https://en.wikipedia.org/wiki/Personal_construct_theory), the procedure itself is mathematically equivalent to a problem from graph theory called [maximal cliques enumeration](https://en.wikipedia.org/wiki/Clique_problem#Listing_all_maximal_cliques).
14
+
Given a similarity measure, in our case the number of matching scores between
15
+
two constructs, a network graph of relatedness between constructs is construed.
16
+
A clique is a group of constructs which are all mutually related, given some
17
+
cut-off criterion for relatedness (e.g. 6 matching scores in a grid with 7
18
+
elements). While an offline approach is also described to find the construct
19
+
cliques, this software automates the process. Below you see the resulting
20
+
cliques for Sylvia's sample grid. In the paper, the interpretation of the
21
+
discovered cliques is discussed in detail.
14
22
15
23

16
24
17
25
26
+
# Statement of need
27
+
28
+
Currently, the IC method is not implemented in any other existing repertory grid
29
+
software. While IC can also be conducted by hand, this is very time consuming,
30
+
error-prone and only feasible for small-sized grids. Hence, a software solution
31
+
to support the IC procedure is needed. Without proper software support which
32
+
facilitates the process, the IC method is likely to become a methodological
33
+
contribution which will rarely be used in research due to above mentioned
34
+
reasons.
35
+
36
+
37
+
18
38
## Installation
19
39
20
40
You can install the latest official release version from CRAN
@@ -44,3 +64,12 @@ You can find the datasets used in our publication on Zenodo.
In order to maximize the package's usefulness for the research community, we
71
+
welcome participation in the package's development. Experienced R programmers
72
+
are asked to make pull requests to the [`OpenRepGrid.ic` github repository](https://github.com/markheckmann/OpenRepGrid.ic), [report issues](https://github.com/markheckmann/OpenRepGrid.ic/issues), or commit code
73
+
snippets. Non-technical oriented researchers are invited to send us feature
0 commit comments