Sciweavers

728 search results - page 41 / 146
» Mining for Empty Rectangles in Large Data Sets
Sort
View
IPPS
2008
IEEE
14 years 2 months ago
Parallel mining of closed quasi-cliques
Graph structure can model the relationships among a set of objects. Mining quasi-clique patterns from large dense graph data makes sense with respect to both statistic and applica...
Yuzhou Zhang, Jianyong Wang, Zhiping Zeng, Lizhu Z...
SIGMOD
2000
ACM
129views Database» more  SIGMOD 2000»
14 years 8 days ago
Mining Frequent Patterns without Candidate Generation
Mining frequent patterns in transaction databases, time-series databases, and many other kinds of databases has been studied popularly in data mining research. Most of the previous...
Jiawei Han, Jian Pei, Yiwen Yin
BMCBI
2005
152views more  BMCBI 2005»
13 years 7 months ago
GeneKeyDB: A lightweight, gene-centric, relational database to support data mining environments
Background: The analysis of biological data is greatly enhanced by existing or emerging databases. Most existing databases, with few exceptions are not designed to easily support ...
S. A. Kirov, X. Peng, E. Baker, D. Schmoyer, B. Zh...
FSTTCS
1993
Springer
14 years 17 hour ago
Induce-Statements and Induce-Expressions: Constructs for Inductive Programming
A for-loop is somewhat similar to an inductive argument. Just as the truth of a proposition P(n + 1) depends on the truth of P(n), the correctness of iteration n+1 of a for-loop de...
Theodore S. Norvell
ICDM
2010
IEEE
105views Data Mining» more  ICDM 2010»
13 years 5 months ago
On the Vulnerability of Large Graphs
Given a large graph, like a computer network, which k nodes should we immunize (or monitor, or remove), to make it as robust as possible against a computer virus attack? We need (...
Hanghang Tong, B. Aditya Prakash, Charalampos E. T...