[FIX] Order 1 improved, to test

src/Gargantext/Core/Methods/Distances/Conditional.hs

@@ -15,6 +15,48 @@ Motivation and definition of the @Conditional@ distance.
 module Gargantext.Core.Methods.Distances.Conditional
   where
 
+import Data.List (unzip)
+import Data.Maybe (catMaybes)
+import Gargantext.Prelude
+import qualified Data.HashMap.Strict as Map
+import qualified Data.Set            as Set
+import Data.Hashable (Hashable)
+
+type HashMap = Map.HashMap
+------------------------------------------------------------------------
+-- First version as first implementation
+-- - unoptimized but qualitatively verified
+
+getMax :: (a,a) -> Maybe Double -> Maybe Double -> Maybe ((a,a), Double)
+getMax (i,j) (Just d) Nothing    = Just ((i,j), d)
+getMax (i,j) Nothing (Just d)    = Just ((j,i), d)
+getMax ij   (Just di) (Just dj) = if di >= dj then getMax ij (Just di) Nothing
+                                              else getMax ij Nothing   (Just dj)
+getMax _ _ _ = Nothing
+
+conditional :: (Ord a, Hashable a) => HashMap (a,a) Int -> HashMap (a,a) Double
+conditional m' = Map.fromList $ catMaybes results
+  where
+    results = [ let
+                  ij = (/) <$> Map.lookup (i,j) m <*> Map.lookup (i,i) m
+                  ji = (/) <$> Map.lookup (j,i) m <*> Map.lookup (j,j) m
+                  in getMax (i,j) ij ji
+
+              | i <- keys
+              , j <- keys
+              , i < j
+              ]
+    -- Converting from Int to Double
+    m       = Map.map fromIntegral m'
+
+    -- Get the matrix coordinates, removing duplicates
+    keys    = Set.toList $ Set.fromList (x <> y)
+    (x,y)   = unzip $ Map.keys m
+
+
+
+
+{-
 import Data.List (sortOn)
 import Data.Map (Map)
 import Data.Matrix hiding (identity)
@@ -120,3 +162,5 @@ conditional m = filterMat (threshold m') m'
                         True  -> x
                         False -> 0
 ------------------------------------------------------------------------
+
+-}

src/Gargantext/Core/Viz/Graph/Tools.hs

@@ -18,9 +18,10 @@ module Gargantext.Core.Viz.Graph.Tools
 import Data.HashMap.Strict (HashMap)
 import Data.Map (Map)
 import Data.Text (Text)
-import Debug.Trace (trace)
+-- import Debug.Trace (trace)
 import GHC.Float (sin, cos)
 import Gargantext.API.Ngrams.Types (NgramsTerm(..))
+import Gargantext.Core.Methods.Distances.Conditional (conditional)
 import Gargantext.Core.Methods.Distances (Distance(..), measure)
 import Gargantext.Core.Methods.Graph.BAC.Proxemy (confluence)
 import Gargantext.Core.Statistics
@@ -96,7 +97,6 @@ cooc2graphWith' doPartitions distance threshold myCooc = do
       where
         (as, bs) = List.unzip $ Map.keys distanceMap
         n' = Set.size $ Set.fromList $ as <> bs
-    ClustersParams rivers _level = clustersParams nodesApprox
 
 {- -- Debug
   saveAsFileDebug "debug/distanceMap" distanceMap
@@ -108,9 +108,7 @@ cooc2graphWith' doPartitions distance threshold myCooc = do
       else panic "Text.Flow: DistanceMap is empty"
 
   let
-    -- bridgeness' = distanceMap
-    bridgeness' = trace ("Rivers: " <> show rivers)
-                $ bridgeness rivers partitions distanceMap
+    bridgeness' = bridgeness (fromIntegral nodesApprox) partitions distanceMap
 
     confluence' = confluence (Map.keys bridgeness') 3 True False
 
@@ -118,7 +116,6 @@ cooc2graphWith' doPartitions distance threshold myCooc = do
                     diag bridgeness' confluence' partitions
 
 
-
 doDistanceMap :: Distance
               -> Threshold
               -> HashMap (NgramsTerm, NgramsTerm) Int
@@ -126,7 +123,7 @@ doDistanceMap :: Distance
                  , Map (Index, Index) Int
                  , Map NgramsTerm Index
                  )
-doDistanceMap distance threshold myCooc = (distanceMap, toIndex ti diag, ti)
+doDistanceMap Distributional threshold myCooc = (distanceMap, toIndex ti diag, ti)
   where
     -- TODO remove below
     (diag, theMatrix) = Map.partitionWithKey (\(x,y) _ -> x == y)
@@ -136,16 +133,18 @@ doDistanceMap distance threshold myCooc = (distanceMap, toIndex ti diag, ti)
     (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
-            {-$ case distance of   -- Removing the Diagonal ?
-                Conditional     -> Map.filterWithKey (\(a,b) _ -> a /= b)
-                Distributional  -> Map.filterWithKey (\(a,b) _ -> a /= b)
-                -}
             $ toIndex ti theMatrix
-
     similarities = measure distance matCooc
+-}
+
+    similarities = measure Distributional
+                 $ map2mat Square 0 tiSize
+                 $ toIndex ti theMatrix
+
     links = round (let n :: Double = fromIntegral tiSize in n * log n)
 
     distanceMap = Map.fromList
@@ -155,24 +154,23 @@ doDistanceMap distance threshold myCooc = (distanceMap, toIndex ti diag, ti)
                 $ Map.filter (> threshold)
                 $ mat2map similarities
 
+doDistanceMap Conditional _threshold myCooc = (distanceMap, toIndex ti myCooc', ti)
+  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)
+
+    distanceMap = toIndex ti
+                $ Map.fromList
+                -- $ List.take links
+                -- $ List.sortOn snd
+                $ HashMap.toList
+                -- $ HashMap.filter (> threshold)
+                $ conditional myCooc
 
 
-------------------------------------------------------------------------
-------------------------------------------------------------------------
-data ClustersParams = ClustersParams { bridgness :: Double
-                                     , louvain   :: Text
-                                     } deriving (Show)
-
-clustersParams :: Int -> ClustersParams
-clustersParams x = ClustersParams (fromIntegral x) "0.00000001" -- y
-  {- where
-    y | x < 100  = "0.000001"
-      | x < 350  = "0.000001"
-      | x < 500  = "0.000001"
-      | x < 1000 = "0.000001"
-      | otherwise = "1"
- -}
 
 ----------------------------------------------------------
 -- | From data to Graph
@@ -188,7 +186,8 @@ data2graph :: ToComId a
            -> Graph
 data2graph labels occurences bridge conf partitions = Graph { _graph_nodes = nodes
                                                             , _graph_edges = edges
-                                                       , _graph_metadata = Nothing }
+                                                            , _graph_metadata = Nothing
+                                                            }
   where
 
     community_id_by_node_id = Map.fromList
@@ -215,14 +214,15 @@ data2graph labels occurences bridge conf partitions = Graph { _graph_nodes = nod
 
     edges = [ Edge { edge_source = cs (show s)
                        , edge_target = cs (show t)
-                       , edge_weight =  d
+                       , edge_weight = weight
                        , edge_confluence = maybe 0 identity $ Map.lookup (s,t) conf
                    -- , edge_confluence = maybe (panic "E: data2graph edges") identity $ Map.lookup (s,t) conf
                        , edge_id     = cs (show i)
                    }
-                   | (i, ((s,t), d)) <- zip ([0..]::[Integer] )
+            | (i, ((s,t), weight)) <- zip ([0..]::[Integer] )
                                      (Map.toList bridge)
-                   , s /= t, d > 0
+            , s /= t
+            , weight > 0
             ]