JAVA实现文本聚类，用到TF/IDF权重，用余弦夹角计算文本相似度，用k-means进行数据聚类等数学和统计 知识。,JAVA realization of text clustering, using TF/IDF weight, calculated using cosine angle between the text of similarity, using k-means clustering for data such as mathematical and statistical

Implementation of Edmonds Karp algorithm that calculates maxFlow of graph. Input: For each test case, the first line contains the number of vertices (n) and the number of arcs (m). Then, there exist m lines, one for each arc (source vertex, endin

利用jena的开放源代码，对自己写得XML-rdf文件进行解析，对RDF属性加上权重，来进行资源表达的一段代码。里面修改部分有注释。-The use of jena open source, written in their own XML-rdf file parsing, to RDF properties coupled with the weight of resources to carry out the expression of a piece of code. Inside a

算法思想：提取文档的TF/IDF权重，然后用余弦定理计算两个多维向量的距离来计算两篇文档的相似度，用标准的k-means算法就可以实现文本聚类。源码为java实现(Algorithm idea: extract the TF/IDF weight of the document, then calculate the distance between two multidimensional vectors by cosine theorem, calculate the similarity