Presentation 2014-05-15
Theoretical Approach to Decomposition of a Visit-Duration of the Access Log into Processing Time and Preprocessing Time of the Next Page
Takahide NOGAYAMA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) A page visit duration, the time period between two consecutive page accesses of the visitor, is widely used to determine how the visitor spent on the page. However, The page visit duration includes the preprocessing time of the next page. Thus, this metric is not proper for considering the actual processing time of the page. We assumed that the visit duration consists of the processing time and the preprocessing time, and proposed a method to decompose them with using the EM algorithm. We evaluated this method can estimate the true parameters with fewer samples.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Access log / Visit duration / EM Algorithm / Decomposition
Paper # LOIS2014-3
Date of Issue

Conference Information
Committee LOIS
Conference Date 2014/5/8(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Life Intelligence and Office Information Systems (LOIS)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Theoretical Approach to Decomposition of a Visit-Duration of the Access Log into Processing Time and Preprocessing Time of the Next Page
Sub Title (in English)
Keyword(1) Access log
Keyword(2) Visit duration
Keyword(3) EM Algorithm
Keyword(4) Decomposition
1st Author's Name Takahide NOGAYAMA
1st Author's Affiliation IBM Research - Tokyo()
Date 2014-05-15
Paper # LOIS2014-3
Volume (vol) vol.114
Number (no) 32
Page pp.pp.-
#Pages 5
Date of Issue