Safe Haskell | None |
---|---|
Language | Haskell2010 |
Documentation
spectral :: Int -> Int -> B -> SparseMatrixXd Source #
Returns the second left singular vector (or Nth) of a sparse spectral process. Assumes the columns are features and rows are observations. B is the normalized matrix (from getB). See Shu et al., "Efficient Spectral Neighborhood Blocking for Entity Resolution", 2011.
spectralCluster :: B -> LabelVector Source #
Returns a vector of cluster labels for two groups by finding the second left singular vector of a special normalized matrix. Assumes the columns are features and rows are observations. B is the normalized matrix (from getB). See Shu et al., "Efficient Spectral Neighborhood Blocking for Entity Resolution", 2011.
spectralClusterK :: Int -> Int -> B -> LabelVector Source #
Returns a vector of cluster labels for two groups by finding the largest singular vectors and on of a special normalized matrix and running kmeans. Assumes the columns are features and rows are observations. B is the normalized matrix (from getB). See Shu et al., "Efficient Spectral Neighborhood Blocking for Entity Resolution", 2011.