Skip to content
Projects
Groups
Snippets
Help
Loading...
Help
Submit feedback
Contribute to GitLab
Sign in
Toggle navigation
haskell-gargantext
Project
Project
Details
Activity
Releases
Cycle Analytics
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Charts
Issues
160
Issues
160
List
Board
Labels
Milestones
Merge Requests
14
Merge Requests
14
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Charts
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Charts
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
gargantext
haskell-gargantext
Commits
c8d86fbb
Commit
c8d86fbb
authored
Mar 25, 2022
by
Alexandre Delanoë
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
[FIX] uncommenting debug code
parent
30ec228e
Pipeline
#2599
failed with stage
in 49 minutes and 12 seconds
Changes
2
Pipelines
1
Hide whitespace changes
Inline
Side-by-side
Showing
2 changed files
with
3 additions
and
11 deletions
+3
-11
CHANGELOG.md
CHANGELOG.md
+1
-0
Tools.hs
src/Gargantext/Core/Viz/Graph/Tools.hs
+2
-11
No files found.
CHANGELOG.md
View file @
c8d86fbb
## Version 0.0.5.8
*
[
FIX
]
reindex ngrams-contexts function
*
[
PARAM
]
decreasing the Candidate list
*
[
FEAT
]
enabling Notebooks for Teams
## Version 0.0.5.7.9.1
*
[
FIX
]
Group revert + NLP French API implemented (WIP)
...
...
src/Gargantext/Core/Viz/Graph/Tools.hs
View file @
c8d86fbb
...
...
@@ -143,14 +143,6 @@ doDistanceMap Distributional threshold myCooc = (distanceMap, toIndex ti diag, t
(
ti
,
_it
)
=
createIndices
theMatrix
tiSize
=
Map
.
size
ti
{-
matCooc = case distance of -- Shape of the Matrix
Conditional -> map2mat Triangle 0 tiSize
Distributional -> map2mat Square 0 tiSize
$ toIndex ti theMatrix
similarities = measure distance matCooc
-}
similarities
=
measure
Distributional
$
map2mat
Square
0
tiSize
$
toIndex
ti
theMatrix
...
...
@@ -170,13 +162,12 @@ doDistanceMap Conditional threshold myCooc = (distanceMap, toIndex ti myCooc', t
where
myCooc'
=
Map
.
fromList
$
HashMap
.
toList
myCooc
(
ti
,
_it
)
=
createIndices
myCooc'
-- tiSize = Map.size ti
-- links = round (let n :: Double = fromIntegral tiSize
in n * log n)
links
=
round
(
let
n
::
Double
=
fromIntegral
(
Map
.
size
ti
)
in
n
*
log
n
)
distanceMap
=
toIndex
ti
$
Map
.
fromList
--
$ List.take links
$
List
.
take
links
$
List
.
sortOn
snd
$
HashMap
.
toList
$
HashMap
.
filter
(
>
threshold
)
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment