Discretization of Multidimensional Web Data for Informative Dense Regions Discovery

2Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Dense regions discovery is an important knowledge discovery process for finding distinct and meaningful patterns from given data. The challenge in dense regions discovery is how to find informative patterns from various types of data stored in structured or unstructured databases, such as mining user patterns from Web data. Therefore, novel approaches are needed to integrate and manage these multi-type data repositories to support new generation information management systems. In this paper, we focus on discussing and purposing several discretization methods for large matrices. The experiments suggest that the discretization methods can be employed in practical Web applications, such as user patterns discovery. © Springer-Verlag 2004.

Cite

CITATION STYLE

APA

Wu, E. H., Ng, M. K., Yip, A. M., & Chan, T. F. (2004). Discretization of Multidimensional Web Data for Informative Dense Regions Discovery. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3314, 718–724. https://doi.org/10.1007/978-3-540-30497-5_112

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free