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.
Original language | English (US) |
---|---|
Pages (from-to) | 718-724 |
Number of pages | 7 |
Journal | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
Volume | 3314 |
DOIs | |
State | Published - 2004 |
Externally published | Yes |
Keywords
- Dense regions discovery
- Discretization
- Web information system
- Web mining
ASJC Scopus subject areas
- Theoretical Computer Science
- General Computer Science