One-path Relaxed Realtime Constraint Mobile User Classification Method in Mobile Clickstreams

• Item type: Journal(1)
• 公開日: 2009-01-15
• タイトル: One-path Relaxed Realtime Constraint Mobile User Classification Method in Mobile Clickstreams
• タイトル / 言語: en
• タイトル: One-path Relaxed Realtime Constraint Mobile User Classification Method in Mobile Clickstreams
• 言語: eng
• キーワード / 主題Scheme: Other
• キーワード / 主題: 特集：日常生活におけるコラボレーション支援技術
• 資源タイプ / 資源タイプ識別子: http://purl.org/coar/resource_type/c_6501
• 資源タイプ: journal article
• その他タイトル / その他のタイトル: モバイルコンピューティング応用
• 著者所属: ACCESS
• 著者所属(英): en
• 著者所属(英): ACCESS
• 著者名: Toshihiko, Yamakami
• 著者名(英): Toshihiko, Yamakami
• 論文抄録 / 内容記述タイプ: Other
• 論文抄録 / 内容記述: The mobile Internet has become increasingly visible in everyday life. As mobile Internet penetration leverages content business opportunities it is crucial to identify methodologies to fit mobile-specific demands. Regularity is one of the important measures to capture <i>easy-come</i> <i>easy-go</i> mobile users. It is known that users with multiple visits per day with a long interval in between have a higher likelihood of revisiting in the following month than other users. The author proposes a 3+1 bit method to incorporate this empirical law in order to cope with the two major mobile restrictions: distributed server environments and large data streams. The proposed method can be performed in a one-path manner with 32-bit word boundary-awareness for memory compaction. Experimental results show that the method is promising for identifying revisiting users under mobile-specific constraints.
• 論文抄録(英) / 内容記述タイプ: Other
• 論文抄録(英) / 内容記述: The mobile Internet has become increasingly visible in everyday life. As mobile Internet penetration leverages content business opportunities, it is crucial to identify methodologies to fit mobile-specific demands. Regularity is one of the important measures to capture <i>easy-come</i>, <i>easy-go</i> mobile users. It is known that users with multiple visits per day with a long interval in between have a higher likelihood of revisiting in the following month than other users. The author proposes a 3+1 bit method to incorporate this empirical law in order to cope with the two major mobile restrictions: distributed server environments and large data streams. The proposed method can be performed in a one-path manner with 32-bit word boundary-awareness for memory compaction. Experimental results show that the method is promising for identifying revisiting users under mobile-specific constraints.
• 書誌レコードID / 収録物識別子タイプ: NCID
• 書誌レコードID / 収録物識別子: AN00116647
• 書誌情報: 情報処理学会論文誌; 巻 50, 号 1, p. 344-351, 発行日 2009-01-15
• ISSN / 収録物識別子タイプ: ISSN
• ISSN / 収録物識別子: 1882-7764