计算权重代码,CSharp代码库,德仔网

代码语言

代码分类

【CSharp】计算权重

作者:善培 / 发布于2015/6/25/ 601


	using System;
	using System.Collections.Generic;
	using System.ComponentModel;
	using System.Data;
	using System.Drawing;
	using System.Linq;
	using System.Text;
	using System.IO;
	using System.Runtime.InteropServices;
	using System.Text.RegularExpressions;
	using System.Windows.Forms;
	
	namespace TFIDF
	{
	 public partial class Form1 : Form
	 {
	 public Dictionary<int, Dictionary<string, int>> docs = new Dictionary<int, Dictionary<string, int>>();
	 public List<string> indexToTerm = new List<string>();//存放所有的词
	 public List<double> wordfreq = new List<double>();
	 public List<double> docfreq = new List<double>();
	
	 public Form1()
	 {
	 InitializeComponent();
	 }
	
	 public bool preprocess(string path)
	 {
	 StreamReader sr = new StreamReader(path,Encoding.GetEncoding("GB2312"));
	 int id = docs.Count;
	 docs.Add(id, new Dictionary<string,int>());
	 string buff = sr.ReadToEnd().Trim();
	 List<string> words = buff.Split(new string[] { " " }, StringSplitOptions.RemoveEmptyEntries).ToList();
	 foreach (string word in words)
	 {//按词遍历
	 if (docs[id].ContainsKey(word))
	 {
	 //List<string> ss = new List<string>();
	 //ss.AddRange(docs[id].Keys);
	 //if(ss.Contains(word))
	 docs[id][word] += 1;
	 }
	 else
	 {
	 indexToTerm.Add(word);//所有语料的词list
	 docs[id].Add(word,1);
	 }
	 //MessageBox.Show(docs[id][word].ToString());
	 }
	 sr.Close();
	 return true;
	 }
	 //计算tf
	 public void comput_tf()
	 {
	 int i;
	 int j;
	 int pos = 0;
	 int sum;
	 for (i = 0; i < docs.Count; i++)//docs.count是文档数
	 {
	 sum = 0;
	 for (j = pos; j < pos + docs[i].Count; j++)
	 {
	 sum += docs[i][indexToTerm[j]];
	 }
	 for (j = pos; j < pos + docs[i].Count; j++)
	 {
	 double tf = Convert.ToDouble(docs[i][indexToTerm[j]]) / Convert.ToDouble(sum);
	 wordfreq.Add(tf);
	 }
	 pos += docs[i].Count;
	
	 }
	 }
	 //计算idf
	 public void comput_idf()
	 {
	 double idf;
	 int i,j;
	 int n;
	 for (i = 0; i < indexToTerm.Count; i++)
	 {
	 n = 0;
	 for (j = 0; j < indexToTerm.Count; j++)
	 {
	 if (indexToTerm[i] == indexToTerm[j])
	 { n = n + 1; }
	 }
	 idf = Convert.ToDouble(Math.Log(Convert.ToDouble(docs.Count) /Convert.ToDouble(n), 2));
	 docfreq.Add(idf);
	 }
	
	
	 }
	
	 private void button1_Click(object sender, EventArgs e)
	 {
	 string filedir = "data";
	 List<string> list_weibo = Directory.GetFiles(filedir).ToList();
	 List<double> result = new List<double>();
	 foreach (string file in list_weibo)
	 {
	 preprocess(file);
	 }
	 comput_tf();
	 // for (int ii = 0; ii < wordfreq.Count; ii++) { MessageBox.Show(wordfreq[ii].ToString()); }
	 comput_idf();
	 //for (int ii = 0; ii < docfreq.Count; ii++) { MessageBox.Show(docfreq[ii].ToString()); }
	 for (int i = 0; i < indexToTerm.Count; i++)
	 {
	 //MessageBox.Show(indexToTerm[i]);
	 double tfidf = wordfreq[i] * docfreq[i];
	 result.Add(tfidf);
	 }
	 for (int k = 0; k < result.Count; k++)
	 {
	 textBox1.Text += result[k]+" ";
	 }
	 }
	 }
	}

评论列表

本站所提供的代码，版权归原作者所有，若有侵犯作者版权，请与我们联系，我们将立即删除或修改。谢谢!
本站所有代码发布及提供者。

试试其它关键字

　计算权重　

同语言下

可能有用的

善培贡献的其它代码(14)