Mengle, S.; Goharian, N.: Passage detection using text classification (2009)
0.01
0.010773253 = product of:
0.050275177 = sum of:
0.010089659 = weight(_text_:information in 2765) [ClassicSimilarity], result of:
0.010089659 = score(doc=2765,freq=8.0), product of:
0.052020688 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.029633347 = queryNorm
0.19395474 = fieldWeight in 2765, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.0390625 = fieldNorm(doc=2765)
0.033494003 = weight(_text_:retrieval in 2765) [ClassicSimilarity], result of:
0.033494003 = score(doc=2765,freq=10.0), product of:
0.08963835 = queryWeight, product of:
3.024915 = idf(docFreq=5836, maxDocs=44218)
0.029633347 = queryNorm
0.37365708 = fieldWeight in 2765, product of:
3.1622777 = tf(freq=10.0), with freq of:
10.0 = termFreq=10.0
3.024915 = idf(docFreq=5836, maxDocs=44218)
0.0390625 = fieldNorm(doc=2765)
0.0066915164 = product of:
0.020074548 = sum of:
0.020074548 = weight(_text_:22 in 2765) [ClassicSimilarity], result of:
0.020074548 = score(doc=2765,freq=2.0), product of:
0.103770934 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.029633347 = queryNorm
0.19345059 = fieldWeight in 2765, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.0390625 = fieldNorm(doc=2765)
0.33333334 = coord(1/3)
0.21428572 = coord(3/14)
- Abstract
- Passages can be hidden within a text to circumvent their disallowed transfer. Such release of compartmentalized information is of concern to all corporate and governmental organizations. Passage retrieval is well studied; we posit, however, that passage detection is not. Passage retrieval is the determination of the degree of relevance of blocks of text, namely passages, comprising a document. Rather than determining the relevance of a document in its entirety, passage retrieval determines the relevance of the individual passages. As such, modified traditional information-retrieval techniques compare terms found in user queries with the individual passages to determine a similarity score for passages of interest. In passage detection, passages are classified into predetermined categories. More often than not, passage detection techniques are deployed to detect hidden paragraphs in documents. That is, to hide information, documents are injected with hidden text into passages. Rather than matching query terms against passages to determine their relevance, using text-mining techniques, the passages are classified. Those documents with hidden passages are defined as infected. Thus, simply stated, passage retrieval is the search for passages relevant to a user query, while passage detection is the classification of passages. That is, in passage detection, passages are labeled with one or more categories from a set of predetermined categories. We present a keyword-based dynamic passage approach (KDP) and demonstrate that KDP outperforms statistically significantly (99% confidence) the other document-splitting approaches by 12% to 18% in the passage detection and passage category-prediction tasks. Furthermore, we evaluate the effects of the feature selection, passage length, ambiguous passages, and finally training-data category distribution on passage-detection accuracy.
- Date
- 22. 3.2009 19:14:43
- Source
- Journal of the American Society for Information Science and Technology. 60(2009) no.4, S.814-825
