-
1
-
-
35748930073
-
-
R. Srikant, Q. Vu, R. Agrawal, Mining association rules with item constraints, in: Proc. Int. Conf. Knowledge Discovery and Data, KDD'97, Boston, MA, 1997, pp. 67-73
-
-
-
-
2
-
-
35748933989
-
-
J.-F. Boulicaut, B. Jeudy, Using constraint for set mining: Should we prune or not? in: Proceedings Bases de Données Avançées, BDA'00, France, Oct. 2000, pp. 221-237
-
-
-
-
3
-
-
0034592924
-
-
J. Pei, J. Han, Can we push more constraints into frequent pattern mining? in: Proc. Int. Conf. Knowledge Discovery and Data Mining, KDD'00, Boston, MA, Aug. 2000, pp. 350-354
-
-
-
-
4
-
-
0035016447
-
-
J. Pei, J. Han, L.V.S. Lakshmanan, Mining frequent itemsets with convertible constraints, in: Proc. IEEE Int. Conf. Data Engineering, ICDE'01, Heidelberg, Germany, Feb. 2001, pp. 433-442
-
-
-
-
5
-
-
0002298494
-
Ant system for job-shop scheduling
-
(in Belgian)
-
Colorni A., Dorigo M., Maniezzo V., and Trubian M. Ant system for job-shop scheduling. Journal of Operations Research, Statistics and Computer Science 34 (1994) 39-53 (in Belgian)
-
(1994)
Journal of Operations Research, Statistics and Computer Science
, Issue.34
, pp. 39-53
-
-
Colorni, A.1
Dorigo, M.2
Maniezzo, V.3
Trubian, M.4
-
7
-
-
35748942082
-
-
M. Dorigo, V. Maniezzo, A. Colorni, Positive feedback as a search strategy, Technical Report Dissertation, Dipartimento di Elettronica, Politecnico di Milano, Italy, 1991, pp. 91-116
-
-
-
-
8
-
-
85148633156
-
Ant-Q: A reinforcement learning approach to the traveling salesman problem
-
ML-95, Morgan Kaufmann, Palo Alto, CA
-
Gambardella L.M., and Dorigo M. Ant-Q: A reinforcement learning approach to the traveling salesman problem. Proceedings of the 12th International Conference on Machine Learning. ML-95 (1995), Morgan Kaufmann, Palo Alto, CA 252-260
-
(1995)
Proceedings of the 12th International Conference on Machine Learning
, pp. 252-260
-
-
Gambardella, L.M.1
Dorigo, M.2
-
9
-
-
35748938566
-
-
B. Bullnheimer, R.F. Hartl, C. Strauss, A new rank-based version of the ant system a computational study, Technical Report POM-03/97, Institute of Management Science, University of Vienna, Austria, 1997, pp. 25-38
-
-
-
-
10
-
-
0031122887
-
Ant colony system: A cooperative learning approach to the traveling salesman problem
-
Dorigo M., and Gambardella L.M. Ant colony system: A cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation 1 (1997) 53-66
-
(1997)
IEEE Transactions on Evolutionary Computation
, Issue.1
, pp. 53-66
-
-
Dorigo, M.1
Gambardella, L.M.2
-
11
-
-
0030707239
-
The max-min ant system and local search for the traveling salesman problem
-
ICEC'97, IEEE Press, Piscataway, NJ
-
Stuttzle T., and Hoos H.H. The max-min ant system and local search for the traveling salesman problem. Proceedings of the 1997 IEEE International Conference on Evolutionary Computation. ICEC'97 (1997), IEEE Press, Piscataway, NJ 309-314
-
(1997)
Proceedings of the 1997 IEEE International Conference on Evolutionary Computation
, pp. 309-314
-
-
Stuttzle, T.1
Hoos, H.H.2
-
15
-
-
0027621699
-
-
R. Agrawal, T. Imielinski, A. Swami, Mining association rules between sets of items in large databases, in: Proc. ACM-SIGMOD Int. Conf. Management of Data, SIGMOD'93, Washington, USA, May 1993, pp. 207-216
-
-
-
-
16
-
-
0027883358
-
Database mining: A performance perspective, (Learning and discovery in knowledge-based databases)
-
(Special issue)
-
Agrawal R., Imielinski T., and Swami A. Database mining: A performance perspective, (Learning and discovery in knowledge-based databases). IEEE Transactions on Knowledge and Data Engineering 5 6 (1993) 914-925 (Special issue)
-
(1993)
IEEE Transactions on Knowledge and Data Engineering
, vol.5
, Issue.6
, pp. 914-925
-
-
Agrawal, R.1
Imielinski, T.2
Swami, A.3
-
17
-
-
35748978951
-
-
J. Han, J. Pei, Mining frequent patterns by pattern-growth: Methodology and implications, ACM SIGKDD Explorations Newsletter, 2000, pp. 14-20
-
-
-
-
19
-
-
35748951441
-
-
H. Toivonen, Sampling large databases for association rules, in: Proceedings of the International Conference on Very Large Data Bases, Mumbai (Bombay), India, 1996, pp. 134-145
-
-
-
-
21
-
-
0036565197
-
Pincer-Search: An efficient algorithm for discovering the maximum frequent set
-
Lin D., and Kedem Z. Pincer-Search: An efficient algorithm for discovering the maximum frequent set. IEEE Transactions on Knowledge and Data Engineering 14 3 (2002) 553-566
-
(2002)
IEEE Transactions on Knowledge and Data Engineering
, vol.14
, Issue.3
, pp. 553-566
-
-
Lin, D.1
Kedem, Z.2
-
22
-
-
0032091573
-
-
R.J. Bayardo, Efficiently mining long patterns from database, in: Proceedings of the ACM SIGMOD International Conference on Management of Data, Washington, USA, 1998, pp. 85-93
-
-
-
-
23
-
-
35748986549
-
-
A. Savasere, E. Omiecinski, S. Navathe, An efficient algorithm for mining associate rules in large databases, in: Proceedings of the International Conference on Very Large Data Bases, Zurich, Switzerland, 1995, pp. 432-444
-
-
-
-
24
-
-
35748963643
-
-
S. Rafael Parpinelli, S. Heitor Lopes, A. Alex Freitas, An ant colony based system for data mining: Applications to medical data, in: Proc. Int. Conf. Knowledge Discovery and Data, Boston, MA, 2000, pp. 55-62
-
-
-
-
25
-
-
84964452116
-
-
B. Wu, Z. Shi, A clustering algorithm based on swarm intelligence, in: Proceedings of International Conference on Info-tech and Info-net, vol. 3, Beijing, Oct. 2001, pp. 58-66
-
-
-
-
26
-
-
34547504064
-
-
W.M. Teles, L. Weigang, C.G. Ralha, AntWeb - the adaptive web server based on the ants' behavior, in: Proceedings of IEEE/WIC International Conference on Wed Intelligence, Oct. 2003, pp. 558-561
-
-
-
-
27
-
-
35748975255
-
-
B.D. Su, Discovering association rules through ant systems, Master Thesis of National Chin-Hwa Univeristy, Taiwan, ROC, 2002
-
-
-
-
28
-
-
0001235540
-
An analysis of several heuristics for the traveling salesman problem
-
Rosenkrantz D.J., Stearns R.E., and Lewis P.M. An analysis of several heuristics for the traveling salesman problem. SIAM Journal of Computing 6 3 (1997) 563-581
-
(1997)
SIAM Journal of Computing
, vol.6
, Issue.3
, pp. 563-581
-
-
Rosenkrantz, D.J.1
Stearns, R.E.2
Lewis, P.M.3
|