Sciweavers

20441 search results - page 3619 / 4089
» Locally Computable Structures
Sort
View
ICDE
2008
IEEE
141views Database» more  ICDE 2008»
16 years 6 months ago
A General Framework for Fast Co-clustering on Large Datasets Using Matrix Decomposition
Abstract-- Simultaneously clustering columns and rows (coclustering) of large data matrix is an important problem with wide applications, such as document mining, microarray analys...
Feng Pan, Xiang Zhang, Wei Wang 0010
ICDE
2006
IEEE
127views Database» more  ICDE 2006»
16 years 6 months ago
Indexing for Dynamic Abstract Regions
for Dynamic Abstract Regions Joxan Jaffar Roland H.C. Yap School of Computing National University of Singapore 3 Science Drive 2, 117543, Singapore {joxan, ryap}@comp.nus.edu.sg Ke...
Joxan Jaffar, Roland H. C. Yap, Kenny Qili Zhu
ICDE
2006
IEEE
222views Database» more  ICDE 2006»
16 years 6 months ago
CLAN: An Algorithm for Mining Closed Cliques from Large Dense Graph Databases
Most previously proposed frequent graph mining algorithms are intended to find the complete set of all frequent, closed subgraphs. However, in many cases only a subset of the freq...
Jianyong Wang, Zhiping Zeng, Lizhu Zhou
ICDE
2003
IEEE
129views Database» more  ICDE 2003»
16 years 6 months ago
Representing Web Graphs
A Web repository is a large special-purpose collection of Web pages and associated indexes. Many useful queries and computations over such repositories involve traversal and navig...
Sriram Raghavan, Hector Garcia-Molina
ICDE
2002
IEEE
106views Database» more  ICDE 2002»
16 years 6 months ago
OSSM: A Segmentation Approach to Optimize Frequency Counting
Computing the frequency of a pattern is one of the key operations in data mining algorithms. We describe a simple yet powerful way of speeding up any form of frequency counting sa...
Carson Kai-Sang Leung, Raymond T. Ng, Heikki Manni...
« Prev « First page 3619 / 4089 Last » Next »