Biology Reference
In-Depth Information
[10]
D. Eppstein. Arboricity and bipartite subgraph listing algorithm.
Information Pro-
cessing Letters
, 51(4), p207-211, 1994.
[11]
Formal Concept Analysis Homepage. http://www.upriss.org.uk/fca/fca.html
[12]
B. Ganter, G. Stumme, R. Wille (eds.). Formal Concept Analysis: Foundations and
Applications.
Lecture Notes in Computer Science
, vol 3626, Springer, 2005.
[13]
B. Ganter, R. Wille. Formal Concept Analysis: Mathematical Foundations. Springer
Verlag, 1996 (Germany version), 1999 (English version).
[14]
D.S. Johnson, M. Yannakakis, C.H. Papadimitriou. On generating all maximal inde-
pendent sets.
Information Processing Letters
, 27, p119-123, 1988.
[15]
T. Kashiwabara, S. Masuda, K. Nakajima, T. Fujisawa. Generation of maximal in-
dependent sets of a bipartite graph and maximum cliques of a circular-arc graph.
J. Algorithms
, 13, p161-174, 1992.
[16]
S.O. Kuznetsov. Complexity of learning in context lattices from positive and negative
examples.
Discrete Applied Mathematics
, 142, p111-125, 2004.
[17]
S.O. Kuznetsov. On computing the size of a lattice and related decision problems.
Order
, 18, p313-321, 2001.
[18]
S.O. Kuznetsov and S.A. Obedkov. Comparing performance of algorithms for gener-
ating concept lattices.
Journal of Experimental and Theoretical Artificial Intelligence
,
14(23), p189-216, 2002.
[19]
C. Lindig. Fast concept analysis. Gerhard Stumme ed.
Working with Conceptual
Structures - Contributions to ICCS 2000
, Shaker Verlag, Aachen, Germany, 2000.
[20]
K. Makino, T. Uno. New algorithms for eumerating all maximal cliques.
Proc. 9th
Scand. Workshop on Algorithm Theory (SWAT 2004)
, p260-272. Springer Verlag,
Lecture Notes in Computer Science 3111, 2004.
[21]
E.M. Norris. An algorithm for computing the maximal rectangles in a binary relation.
Revue Roumaine de mathematiques Pures et Appliquees
, 23(2), p243-250, 1978.
[22]
L. Nourine, O. Raynaud. A fast algorithm for building lattices.
Information Process-
ing Letters
, 71, p199-204, 1999.
[23]
L. Nourine, O. Raynaud. A fast incremental algorithm for building lattices.
J. of Ex-
perimental and Theoretical Artificial Intelligence
, 14, p217-227, 2002.
[24]
N. Pasquier, Y. Bastide, R. Taouil, L. Lakhal. Efficient mining of association rules
using closed itemset lattices.
Information Systems
, 24(1), p25-46, 1999.
[25]
J. Pei, J. Han, R. Mao. CLOSET: An efficient algorithm for mining frequent closed
itemsets.
Proc. ACM SIGMOD Workshop on Research Issues in Data Mining and
Knowledge Discovery
, p21-30, 2000.
[26]
F. Rioult, J.F. Boulicaut, B. Cremilleux, J. Besson. Using transposition for pattern
discovery from microarray data.
Proc. 8th ACM SIGMOD workshop on Research
issues in Data Mining and Knowledge Discovery
, p73-79, 2003.
[27]
G. Stumme, R. Taouil, Y. Bastide, N. Pasquier, L. Lakhal. Fast Computation of Con-
cept Lattices using data mining techniques.
Proc. 7th International Workshop on
Knowledge Representation meets Databases
, p129-139, 2000.
[28]
S. Tsukiyama, M. Ide, H. Ariyoshi, and I. Shirakawa. A new algorithm for generating
all the maximal independent sets
SIAM Journal on Computing
, 6(3), p505-517, 1977.
[29]
T. Uno and T. Asai, H. Arimura and Y. Uchida. LCM: An Efficient Algorithm for
Enumerating Frequent Closed Item Sets.
IEEE ICDM'04 Workshop FIMI'03 (Inter-
national Conference on Data Mining, Frequent Itemset Mining Implementations).
Search WWH ::
Custom Search