-
1
-
-
26944489623
-
An output-polynomial time algorithm for mining frequent closed attribute trees
-
Arimura, H., & Uno, T. (2005). An output-polynomial time algorithm for mining frequent closed attribute trees. In ILP (pp. 1-19).
-
(2005)
ILP
, pp. 1-19
-
-
Arimura, H.1
Uno, T.2
-
2
-
-
12244254876
-
Efficient substructure discovery from large semi-structured data
-
Asai, T., Abe, K., Kawasoe, S., Arimura, H., Sakamoto, H., & Arikawa, S. (2002). Efficient substructure discovery from large semi-structured data. In SDM.
-
(2002)
SDM
-
-
Asai, T.1
Abe, K.2
Kawasoe, S.3
Arimura, H.4
Sakamoto, H.5
Arikawa, S.6
-
3
-
-
0242360778
-
Discovering frequent substructures in large unordered trees
-
Asai, T., Arimura, H., Uno, T., & Nakano, S.-I. (2003). Discovering frequent substructures in large unordered trees. In Discovery science (pp. 47-61).
-
(2003)
Discovery Science
, pp. 47-61
-
-
Asai, T.1
Arimura, H.2
Uno, T.3
Nakano, S.-I.4
-
5
-
-
37349032961
-
Mining frequent closed unordered trees through natural representations
-
Balcázar, J. L., Bifet, A., & Lozano, A. (2007). Mining frequent closed unordered trees through natural representations. In ICCS 2007, 15th international conference on conceptual structures (pp. 347-359).
-
(2007)
ICCS 2007, 15th International Conference on Conceptual Structures
, pp. 347-359
-
-
Balcázar, J.L.1
Bifet, A.2
Lozano, A.3
-
6
-
-
77049116292
-
On Horn axiomatizations for sequential data
-
Balcázar, J. L., & Garriga, G. C. (2005). On Horn axiomatizations for sequential data. In ICDT (pp. 215-229)
-
(2005)
ICDT
, pp. 215-229
-
-
Balcázar, J.L.1
Garriga, G.C.2
-
7
-
-
33846782841
-
-
(extended version in Theoretical Computer Science, 371, 247-264, 2007).
-
(2007)
Theoretical Computer Science
, vol.371
, pp. 247-264
-
-
-
8
-
-
37349030626
-
Intersection algorithms and a closure operator on unordered trees
-
Balcázar, J. L., Bifet, A., & Lozano, A. (2006). Intersection algorithms and a closure operator on unordered trees. In MLG 2006, 4th international workshop on mining and learning with graphs.
-
(2006)
MLG 2006, 4th International Workshop on Mining and Learning with Graphs
-
-
Balcázar, J.L.1
Bifet, A.2
Lozano, A.3
-
9
-
-
47849126620
-
Subtree testing and closed tree mining through natural representations
-
Balcázar, J. L., Bifet, A., & Lozano, A. (2007). Subtree testing and closed tree mining through natural representations. In DEXA workshops (pp. 499-503).
-
(2007)
DEXA Workshops
, pp. 499-503
-
-
Balcázar, J.L.1
Bifet, A.2
Lozano, A.3
-
11
-
-
0000621555
-
Constant time generation of rooted trees
-
Beyer, T., & Hedetniemi, S. M. (1980). Constant time generation of rooted trees. SIAM Journal on Computing, 9(4), 706-712.
-
(1980)
SIAM Journal on Computing
, vol.9
, Issue.4
, pp. 706-712
-
-
Beyer, T.1
Hedetniemi, S.M.2
-
14
-
-
0035009221
-
Modeling the branching characteristics and efficiency gains of global multicast trees
-
April 2001
-
Chalmers, R., & Almeroth, K. (2001). Modeling the branching characteristics and efficiency gains of global multicast trees. In Proceedings of the IEEE INFOCOM'2001, April 2001.
-
(2001)
Proceedings of the IEEE INFOCOM'2001
-
-
Chalmers, R.1
Almeroth, K.2
-
15
-
-
33746034254
-
Frequent subtree mining-an overview
-
Chi, Y., Muntz, R., Nijssen, S., & Kok, J. (2001a). Frequent subtree mining-an overview. Fundamenta Informaticae, XXI, 1001-1038.
-
(2001)
Fundamenta Informaticae
, vol.21
, pp. 1001-1038
-
-
Chi, Y.1
Muntz, R.2
Nijssen, S.3
Kok, J.4
-
16
-
-
33746034254
-
Mining closed and maximal frequent subtrees from databases of labeled rooted trees
-
Chi, Y., Xia, Y., Yang, Y., & Muntz, R. (2001b). Mining closed and maximal frequent subtrees from databases of labeled rooted trees. Fundamenta Informaticae, XXI, 1001-1038.
-
(2001)
Fundamenta Informaticae
, vol.21
, pp. 1001-1038
-
-
Chi, Y.1
Xia, Y.2
Yang, Y.3
Muntz, R.4
-
18
-
-
21844454174
-
Canonical forms for labelled trees and their applications in frequent subtree mining
-
DOI 10.1007/s10115-004-0180-7
-
Chi, Y., Yang, Y., & Muntz, R. R. (2005). Canonical forms for labelled trees and their applications in frequent subtree mining. Knowledge and Information Systems, 8(2), 203-234. (Pubitemid 40951991)
-
(2005)
Knowledge and Information Systems
, vol.8
, Issue.2
, pp. 203-234
-
-
Chi, Y.1
Yang, Y.2
Muntz, R.R.3
-
21
-
-
35048879345
-
Coproduct transformations on lattices of closed partial orders
-
Garriga, G. C., & Balcázar, J. L. (2004). Coproduct transformations on lattices of closed partial orders. In ICGT (pp. 336-352).
-
(2004)
ICGT
, pp. 336-352
-
-
Garriga, G.C.1
Balcázar, J.L.2
-
22
-
-
42149183175
-
A new efficient probabilistic model for mining labeled ordered trees applied to glycobiology
-
Hashimoto, K., Aoki-Kinoshita, K. F., Ueda, N., Kanehisa, M., & Mamitsuka, H. (2008). A new efficient probabilistic model for mining labeled ordered trees applied to glycobiology. ACM Transactions on Knowledge Discovery from Data, 2(1), 1-30.
-
(2008)
ACM Transactions on Knowledge Discovery from Data
, vol.2
, Issue.1
, pp. 1-30
-
-
Hashimoto, K.1
Aoki-Kinoshita, K.F.2
Ueda, N.3
Kanehisa, M.4
Mamitsuka, H.5
-
23
-
-
21844486148
-
On the complexity of comparing evolutionary trees
-
Z. Galil E. Ukkonen (Eds.) Espoo, Finland. Berlin: Springer
-
Hein, J., Jiang, T., Wang, L., & Zhang, K. (1995). On the complexity of comparing evolutionary trees. In Z. Galil & E. Ukkonen (Eds.) Proceedings of the 6th annual symposium on combinatorial pattern matching (pp. 177-190), Espoo, Finland. Berlin: Springer.
-
(1995)
Proceedings of the 6th Annual Symposium on Combinatorial Pattern Matching
, pp. 177-190
-
-
Hein, J.1
Jiang, T.2
Wang, L.3
Zhang, K.4
-
27
-
-
0001880210
-
KDD-Cup 2000 organizers' report: Peeling the onion
-
Kohavi, R., Brodley, C., Frasca, B., Mason, L., & Zheng, Z. (2000). KDD-Cup 2000 organizers' report: peeling the onion. SIGKDD Explorations, 2(2), 86-98.
-
(2000)
SIGKDD Explorations
, vol.2
, Issue.2
, pp. 86-98
-
-
Kohavi, R.1
Brodley, C.2
Frasca, B.3
Mason, L.4
Zheng, Z.5
-
28
-
-
0033284591
-
Approximate tree matching and shape similarity
-
Liu, T.-L., & Geiger, D. (1999). Approximate tree matching and shape similarity. In ICCV (pp. 456-462).
-
(1999)
ICCV
, pp. 456-462
-
-
Liu, T.-L.1
Geiger, D.2
-
29
-
-
10644296163
-
-
Universita Di Pisa
-
Luccio, F., Enriquez, A. M., Rieumont, P. O., & Pagli, L. (2001). Exact rooted subtree matching in sublinear time (Technical Report TR-01-14). Universita Di Pisa.
-
(2001)
Exact Rooted Subtree Matching in Sublinear Time (Technical Report TR-01-14)
-
-
Luccio, F.1
Enriquez, A.M.2
Rieumont, P.O.3
Pagli, L.4
-
30
-
-
14644415709
-
-
Luccio, F., Enriquez, A. M., Rieumont, P. O., & Pagli, L. (2004). Bottom-up subtree isomorphism for unordered labeled trees.
-
(2004)
Bottom-up Subtree Isomorphism for Unordered Labeled Trees
-
-
Luccio, F.1
Enriquez, A.M.2
Rieumont, P.O.3
Pagli, L.4
-
32
-
-
84972130012
-
How to obtain an asymptotic expansion of a sequence from an analytic identity satisfied by its generating function
-
Plotkin, J. M., & Rosenthal, J. W. (1994). How to obtain an asymptotic expansion of a sequence from an analytic identity satisfied by its generating function. Journal of the Australian Mathematical Society (Series A), 56, 131-143.
-
(1994)
Journal of the Australian Mathematical Society (Series A)
, vol.56
, pp. 131-143
-
-
Plotkin, J.M.1
Rosenthal, J.W.2
-
34
-
-
19544369474
-
DRYADE: A new approach for discovering closed frequent trees in heterogeneous tree databases
-
Termier, A., Rousset, M.-C., & Sebag, M. (2004). DRYADE: a new approach for discovering closed frequent trees in heterogeneous tree databases. In ICDM (pp. 543-546).
-
(2004)
ICDM
, pp. 543-546
-
-
Termier, A.1
Rousset, M.-C.2
Sebag, M.3
-
35
-
-
38749128764
-
Dryadeparent, an efficient and robust closed attribute tree mining algorithm
-
DOI 10.1109/TKDE.2007.190695
-
Termier, A., Rousset, M.-C., Sebag, M., Ohara, K., Washio, T., & Motoda, H. (2008). DryadeParent, an efficient and robust closed attribute tree mining algorithm. IEEE Transactions on Knowledge and Data Engineering, 20(3), 300-320. (Pubitemid 351185382)
-
(2008)
IEEE Transactions on Knowledge and Data Engineering
, vol.20
, Issue.3
, pp. 300-320
-
-
Termier, A.1
Rousset, M.-C.2
Sebag, M.3
Ohara, K.4
Washio, T.5
Motoda, H.6
-
37
-
-
84891388102
-
-
Berlin: Springer
-
Weiss, S., Indurkhya, N., Zhang, T., & Damerau, F. (2004). Text mining: predictive methods for analyzing unstructured information. Berlin: Springer.
-
(2004)
Text Mining: Predictive Methods for Analyzing Unstructured Information
-
-
Weiss, S.1
Indurkhya, N.2
Zhang, T.3
Damerau, F.4
-
38
-
-
12244304650
-
Efficient data mining for maximal frequent subtrees
-
Washington: IEEE Computer Society
-
Xiao, Y., Yao, J.-F., Li, Z., & Dunham, M. H. (2003). Efficient data mining for maximal frequent subtrees. In ICDM '03: proceedings of the third IEEE international conference on data mining (p. 379). Washington: IEEE Computer Society.
-
(2003)
ICDM '03: Proceedings of the Third IEEE International Conference on Data Mining
, pp. 379
-
-
Xiao, Y.1
Yao, J.-F.2
Li, Z.3
Dunham, M.H.4
-
41
-
-
4444326044
-
Clospan: Mining closed sequential patterns in large databases
-
Yan, X., Han, J., & Afshar, R. (2003). Clospan: mining closed sequential patterns in large databases. In SDM.
-
(2003)
SDM
-
-
Yan, X.1
Han, J.2
Afshar, R.3
-
44
-
-
24044516553
-
Efficiently mining frequent embedded unordered trees
-
Zaki, M. J. (2005). Efficiently mining frequent embedded unordered trees. Fundamenta Mathematicae, 66(12), 33-52. (Pubitemid 41218091)
-
(2005)
Fundamenta Informaticae
, vol.66
, Issue.1-2
, pp. 33-52
-
-
Zaki, M.J.1
|