• 计算百度关键词出现密度


            /// <summary>
            /// 获取百度关键词出现的密度
            /// </summary>
            /// <param name="keyWord">标题、关键词</param>
            /// <returns>如:10 (满为100)</returns>
            public static int GetBaiDuKeywordDensity(string keyWord)
            {
                //获取百度源码
                string HtmlCode = GetHttpData("http://www.baidu.com/s?wd=" + keyWord);
                //百度搜索出来的标题列表
                List<string> listTitle = new List<string>();
                //列表正则匹配规则
                string strrex = @"<h3[sS]*?>(?<url>.*?)</h3>";
    
                //进行正则匹配
                MatchCollection mc = Regex.Matches(HtmlCode, strrex);
                foreach (Match m in mc)
                {
                    string content =HtmlDecodes(Environment.NewLine + m.Groups["url"].Value);
                 content=   ReplaceHtml(content);
                    listTitle.Add(RemoveHTML(content));
                }
    
                //只匹配第一条
                for (int i = 0; i < listTitle.Count; i++)
                {
                    return Convert.ToInt32(Similarity(listTitle[0], keyWord) * 100);
                }
    
                //相似度列表
               // List<double> listSimilarity = new List<double>();
                //进行相似度计算
                //foreach (string strTitle in listTitle)
                //{
                //    listSimilarity.Add(Similarity(strTitle, keyWord));
                //}
    
                //进行密度计算
                //int dev = Convert.ToInt32(stdev(listSimilarity) * 100);
                //if (dev<=0 || dev > 100)
                //{
                //    dev = Convert.ToInt32(average(listSimilarity) * 100);
                //}
                //return dev ;
                return 0;
            }
    

      

  • 相关阅读:
    UVa 12174 (滑动窗口) Shuffle
    UVa 1607 (二分) Gates
    CodeForces ZeptoLab Code Rush 2015
    HDU 1525 (博弈) Euclid's Game
    HDU 2147 (博弈) kiki's game
    UVa 11093 Just Finish it up
    UVa 10954 (Huffman 优先队列) Add All
    CodeForces Round #298 Div.2
    UVa 12627 (递归 计数 找规律) Erratic Expansion
    UVa 714 (二分) Copying Books
  • 原文地址:https://www.cnblogs.com/Aamir-Ye/p/4561201.html
Copyright © 2020-2023  润新知