Review of "Mining the Web: discovering knowledge from hypertext data" by Soumen Chakrabati. Morgan Kaufman 2003.

By Chaomei Chen. SIGF, 2002

683 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/2fb318e0c3e9c2b11e711d3182c76f3dd39d1322

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Information Systems

Citations in the corpus

TAGME: on-the-fly annotation of short text fragments (by wikipedia entities) (2010, methodology): “We designed and implemented Tagme, a system that is able to efficiently and judiciously augment a plain-text with pertinent hyperlinks to Wikipedia pages.”
Opinion spam and analysis (2008, background): “The similarity score of two reviews is the ratio of intersection of their 2-grams to the union of their 2-grams of the two reviews, which is usually called the Jaccard distance [6].”
Topic-sensitive PageRank (2002, background): “For further information on large-scale search systems, we refer the reader to [30], [9].”
Mining knowledge from text using information extraction (2005, background): “Such a simplified representation of text has been shown to be quite effective for a number of standard tasks such as document retrieval, classification, and clustering [2; 16; 66; 60].”
Mining data records in Web pages (2003, background): “Children); j+i) 6 if Distance(Node, i, j) <= T then 7 if flag=true then 8 curDR = [i, j, 2*i]; 9 flag = false; 10 else curDR[3] = curDR[3] + i; 11 elseif flag = false then Exit-inner-loop; 12 end; 13 if (maxDR[3] < curDR[3]) and (maxDR[2] = 0 or (curDR[2]<= maxDR[2]) then 14 maxDR = curDR; 15 end 16”
Dependency Tree-based Sentiment Classification using CRFs with Hidden Variables (2010, background): “Topic-based text classiﬁcation is generally a linearly separable problem ((Chakrabarti, 2002), p.168).”
Eliminating noisy information in Web pages for data mining (2003, background): “Data mining on the Web thus becomes an important task for discovering useful knowledge or information from the Web [6][9].”
Detecting near-duplicates for web crawling (2007, background): “For web crawling, issues like freshness and efficient resource usage have previously been addressed [15, 16, 19].”
POLYPHONET: an advanced social network extraction system from the web (2006, methodology): “Therefore, statistical methods are effective: We first apply χ(2) statistics to the affiliation matrix and calculate cosine similarity [8].”
Discovering Large Dense Subgraphs in Massive Graphs (2005, methodology): “…introduced in [9], and have since seen wide usage to estimate the similarity of web pages us-ing a particular feature extraction scheme based on overlapping windows of terms (motivating the name “shingles”); they were also used to detect mirror sites (see Chakrabarti [11] and Bharat et al. [5]).”
Web data extraction based on partial tree alignment (2005, neutral): “(ii) The proposed system identifies data records by analyzing HTML tag trees or DOM trees [7].”