Biology Reference
In-Depth Information
[30]
P. Valtchev, R. Missaoui, R. Godin, M. Meridji. Generating frequent itemsets incre-
mentally: two novel approaches based on Galois lattice theory.
Journal of Experi-
mental and Theoretical Artificial Intelligence
, 14(2-3), p115-142, 2002.
[31]
P. Valtchev, R. Missaoui, P. Lebrun. A partition-based approach towards constructing
Galois (concept) lattices.
Discrete Mathematics
, 256(3), p801-829, 2002
[32]
J. Wang, J. Han, J. Pei. CLOSET+: Searching for the best straegies for mining fre-
quent closed itemsets.
Proc. 9th ACM SIGKDD international conference on Knowl-
edge Discovery and Data mining
, p236-245, 2003.
[33]
R. Wille. Restructuring the lattice theory: An approach based on hierarchies of con-
cepts. In I. Rival, editor,
Ordered sets
, pages 445-470, Dordrecht-Boston, 1982, Rei-
del.
[34]
G. Yang. The complexity of mining maximal frequent itemsets and maximal frequent
patterns.
Proc. 10th ACM SIGKDD International Conference on Knowledge Discov-
ery and Data mining
, p344-353, 2004.
[35]
M.J. Zaki, C.-J. Hsiao. CHARM: An efficient algorithm for closed association rule
mining.
Proc. 2nd SIAM International Conference on Data Mining
, 2002.
[36]
M.J. Zaki, C.-J. Hsiao. Efficient Algorithms for mining closed itemsets and their
lattice structure.
IEEE Trans. Knowledge and Data Engineering
, 17(4), p462-478,
2005.
[37]
M.J. Zaki, M. Ogihara. Theoretical foundations of association rules.
Proc. 3rd ACM
SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery
,
p1-7, 1998.
[38]
M.J. Zaki, N. Ramakrishnan. Reasoning about setes using redescription mining.
Proc.
11th ACM SIGKDD International Conference on Knowledge Discovery and Data
mining
, 2005.
Search WWH ::
Custom Search