21 search results - page 1 / 5 » Efficient Mining of Large Maximal Bicliques |
DAWAK
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. Many real world applications rely on the discovery of maximal biclique subgraphs (complete bipartite subgraphs). However, existing algorithms for enumerating maximal bicl...
SDM
2008
SIAM
13 years 5 months ago
2008
SIAM
The rigid all-versus-all adjacency required by a maximal biclique for its two vertex sets is extremely vulnerable to missing data. In the past, several types of quasi-bicliques ha...
KDD
2009
ACM
14 years 5 months ago
2009
ACM
Influence maximization is the problem of finding a small subset of nodes (seed nodes) in a social network that could maximize the spread of influence. In this paper, we study the ...
TKDE
2008
13 years 4 months ago
2008
Linear Discriminant Analysis (LDA) has been a popular method for extracting features that preserves class separability. The projection functions of LDA are commonly obtained by max...
TKDE
1998
13 years 4 months ago
1998
—In this paper, we explore a new data mining capability that involves mining path traversal patterns in a distributed information-providing environment where documents or objects...