BlockWeb: An IR Model for Block Structured Web Pages

Bruno, Emmanuel; Faessel, Nicolas; Maitre, Jacques Le; Scholl, Micheł

doi:10.1109/cbmi.2009.36

Cited by 3 publications

(3 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Our model was first introduced in [1,2]. With respect to these former versions, the current article not only presents in depth the model but characterizes precisely the impact of importance and permeability on block indexing as well.…”

Section: The Data Modelmentioning

confidence: 99%

“…The weight of terms in local vectors was computed using the t f * idf formula where t f is the number of occurrences of the term in the block and idf is the inverse page frequency. The indexes of blocks are computed according to equation (2). The IP graph of the page is presented in Figure 8.…”

Section: Best Entry Pointmentioning

confidence: 99%

“…For example, Figure 1 sketches the home page of an electronic news paper. This page (block 1) is decomposed into a title block (2) and three article blocks (3, 7, and 8). Block 3 is itself decomposed into three blocks: a title block (4), a body block (5) and an image block (6).…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Indexing and querying segmented web pages: the BlockWeb Model

Bruno

Faessel²,

Glotin

et al. 2011

World Wide Web

Self Cite

View full text Add to dashboard Cite

We present in this paper a model for indexing and querying web pages, based on the hierarchical decomposition of pages into blocks. Splitting up a page into blocks has several advantages in terms of page design, indexing and querying such as (i) blocks of a page most similar to a query may be returned instead of the page as a whole (ii) the importance of a block can be taken into account, as well as (iii) the permeability of the blocks to neighbor blocks: a block b is said to be permeable to a block b in the same page if b content (text, image, etc.) can be (partially) inherited by b upon indexing. An engine implementing this model is described including: the transformation of web pages into blocks hierarchies, the definition of a dedicated language to express indexing rules and the storage of indexed blocks into an XML repository. The model is assessed on a dataset of electronic news, and a dataset drawn from web pages of the ImagEval campaign where it improves by 16% the mean average precision of the baseline.

show abstract

Section: The Data Modelmentioning

confidence: 99%

Section: Best Entry Pointmentioning

confidence: 99%