File detail
advanced_analysis.rq
reqlan rq/modelling/advanced_analysis.rq
| Idea | Status | Tags | Summary | Katz |
|---|---|---|---|---|
| markov_chain | graph traveral should be tracked to inform a markov chain model of the graph. | 0.040 | ||
| centroid_search | allow user or agent to specify multiple nodes, and then to rank matches by lowest distance. | 0.040 | ||
| search_with_context | done | function ( exposed in cli ) that allows user to specify current contex ( set of ideas or ideasets or files ), and a search term, yielding the closest matches, in a context aware way. Implemented as ["../core_analysis/search.rq".contextual_search] ( `AnalysisApi.searchRequirements` + `reqlan search --context` ). | 0.067 | |
| pagerank | Search algorithm from google based on the graph structure? | 0.067 | ||
| idea_graph_distance | done | allow searches to match based on partial match and exponential decay of distance to to ideas matching the search term. Used by ["../core_analysis/search.rq".contextual_search]: `finalScore = textScore * 2^(-minHop)` with unreachable floor 8. | 0.088 | |
| katz_centrality | done | Score each idea by inbound Katz centrality on the citation graph. An idea scores higher when important ideas reference it. The score uses resolved reference edges and wildcard reference edges between ideas. The analysis package exposes the scores as `katzCentrality()`. The top score is 1. A graph with no citation edges gives every idea the score 1. Search can opt in through ["../core_analysis/search.rq".katz_search]. HTML export shows the score through ["../core_analysis/html_export.rq".html_export_katz_column]. | 0.061 |
Related clusters
file
community
folder
status
status
tag
Local graph
Initialising graph…