用python写了一个简单版本的textrank，实现提取关键词的功能。 import numpy as np import jieba import jieba.posseg as pseg class TextRank(object): def __init__(self, sentence, window, alpha, iternum): self.sentence = sentence self.window = window self.alpha = alpha self.edge_dict = {} #记录节点的边连接字典 sel

label matrix 8.002 注册机

布朗大学Philip Klein教授授课，讲述矩阵分析的应用，用python进行编程。

关于矩阵完全的程序，能够快速实现矩阵完全的c源码程序

用Array Vector 实现Matrix 加减乘法

MahNMF Manhattan Non-negative Matrix Factorization code % Manhattan Non-negative Matrix Factorization. % ManhNMF: Matlab Code for Efficient Robust Manhattan NMF Solver % Reference % [1] N. Guan, D. Tao, Z. Luo, and J. Shawe-taylor, "MahNMF: Manhattan % Non-negative Matrix Factorization," arXiv:1207.3438v1, 2012. % [2] N. Guan, D. Tao, Z. Luo, and J. Shawe-taylor, "MahNMF: Manhattan % Non-negative Matrix Factorization," Submitted to Journal of Machine Learning Research, 2013. % The model is X \approx W^TH, where X, W, and H are defined as follows: % X (m x n): data matrix including n samples in m-dimensional space; % W (r x m): basis matrix including r bases in m-dimensional space; % H (r x n): coefficients matrix includeing n encodings in r-dimensional space. % Written by Naiyang Guan (ny.guan@gmail.com) % Copyright 2012-2014 by Naiyang Guan and Dacheng Tao % Modified at Jan. 28 2013 % % X : Input data matrix (m x n) % r : Target low-rank % % (Below are optional arguments: can be set by providing name-value pairs) % MAX_ITER : Maximum number of iterations. Default is 1,000. % MIN_ITER : Minimum number of iterations. Default is 10. % MAX_TIME : Maximum amount of time in seconds. Default is 100,000. % W_INIT : (m x r) initial value for W. % H_INIT : (r x n) initial value for H. % LAM_INIT : initial value of smoothness parameter. Default is 1. % MDL_TYPE : Model type (Default is 'PLAIN'), % 'PLAIN' - MahNMF (min{||X-W^T*H||_1,s.t.,W >= 0 and H >= 0}.), % 'BXC' - Box Constrained MahNMF (min{||X-W^T*H||_1,s.t.,1 >= W >= 0 and 1 >= H >= 0}.), % 'MNR' - Manifold Regularized MahNMF % (min{||X-W^T*H||_1+.5*beta*TR(H*Lp*H^T),s.t.,W >= 0 and H >= 0}.), % 'GSP' - Group Sparse MahNMF % (min{||X-W^T*H||_1+.5*beta*\sum_{g\in G}||W^[g]||_{1,p},s.t.,W >= 0 and H >= 0}.), % 'SYM' - Symmetric MahNMF (min{||X-H*H^T||_1,s.t., H >= 0}.). % ALG_TYPE : Algorithm type (Default is 'AGD'), % 'AGD' - Accelerated Gradient Descent, % 'RRI' - Rank-one Residue Iteration. % BETA : Tradeoff parameter over regularization term. Default is 1e-3. % SIM_MTX : Similarity matrix constructed by 'constructW'. % GPP_MTX : Group pattern for boundary of all groups. % TOL_INNR : Stopping tolerance of inner iterations. Default is 1e-2. % TOL_OUTR : Stopping tolerance of outer iterations. Default is 1e-3. % If you want to obtain a more accurate solution, decrease TOL_INNR or TOL_OUTR and increase MAX_ITER at the same time. % VB_OUTR : 0 (default) - No debugging information is collected. % 1 (debugging purpose) - History of computation is returned by 'HIS' variable. % 2 (debugging purpose) - History of computation is additionally printed on screen. % VB_INNR : 0 (default) - No debugging information is collected. % 1 (debugging purpose) - History of computation is returned by 'HIS' variable. % 2 (debugging purpose) - History of computation is additionally printed on screen. % % W : Obtained basis matrix (r x m). % H : Obtained coefficients matrix (r x n). % iter : Number of iterations. % elapse : CPU time in seconds. % HIS : (debugging purpose) History of computation, % niter - total iteration number spent for Nesterov's optimal % gradient method, % cpus - CPU seconds at iteration rounds, % objf - objective function values at iteration rounds, % dlta - stopping criteria of block coordinate descent. % % % >>X=rand(1000,500); % >>ManhNMF(X,10); % >>ManhNMF(X,20,'verbose',1); % >>ManhNMF(X,30,'verbose',2,'w_init',rand(r,m)); % >>ManhNMF(X,5,'verbose',2,'tol_outr',1e-5); % Note: other files 'GetStopCriterion.m', 'ApproxFunC.m', and 'wmedianf.mexw32' should be included under the same % directory as this code.

一种可扩展的工具，用于可视化邻接矩阵，其中边、方向上的值以及作为节点大小的值的总和。 如果您发现这对您的工作有用，请考虑引用以下参考资料： @文章{yang2018learning, title={大型网络中的学习功能需要模块化并产生多代理动态}， 作者={Yang, CH and Ooi, Rise and Hiscock, Tom and Eguiluz, Victor and Tegner, Jesper}, 期刊={ICML, Workshop of Computational Biology 2018, arXiv preprint arXiv:1807.03001}, 年= {2018} }

matrix-computation 上科大2020秋矩阵计算作业 作业题传上来的都是自己写的或是网上找的答案，大部分没放标准答案，懒得再回去找，因此写的不一定全对。

《Matrix Algorithms（两卷全）》作者：G. W. Stewart ，著作，本资源包含两卷，：[卷一] Matrix Algorithms: Volume 1, Basic Decompositions Paperback；[卷二] Matrix Algorithms, Volume II: Eigensystems Paperback

离散控制Matlab代码LMI 最优和鲁棒控制中的线性矩阵不等式。 线性矩阵不等式：离散系统-HARISHANKAR PRABHAKARAN。 可以在本书中找到这些LMI ：。 这是一组代码，作为Wikibook中离散时间系统的示例程序（我创建的页面在下面列出，并且相应的MATLAB代码可用）： 要运行这些MATLAB代码，需要YALMIP TOOLBOX和诸如SeDuMi或IBM CPLEX之类的求解器。 A1.m-离散时间Lyapunov稳定性（Caverly 3.1.3） A2.m-离散时间有界实引理（H∞范数）（平均3.2.2） A3.m-离散时间H2规范（平均3.3.2） A4.m-离散时间稳定度（平均3.11.2） A5.m-离散时间可检测性（平均3.12.2） A6.m-离散时间H2最佳全状态反馈控制（平均4.2.2） A7.m-离散时间H2-最佳动态输出反馈控制（平均4.2.4） A8.m-离散时间H∞-最佳全状态反馈控制（平均4.3.2） A9.m-离散时间H∞-最佳动态输出反馈控制（平均4.3.4） A10.m-离散时间混合H2-H∞-最佳全状态反馈控制（平均4.4