Comparing performance of algorithms for generating concept lattices

Author： Kuznetsov Sergei O.   Obiedkov Sergei A.  

Publisher： Taylor & Francis Ltd

ISSN： 1362-3079

Source： Journal of Experimental & Theoretical Artificial Intelligence, Vol.14, Iss.2-3, 2002-04, pp. : 189-216

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A simulated annealing technique for generating artificial data to assess concept learning algorithms

By Hunniford T.J.C.   Hickey R.J.  

Intelligent Data Analysis, Vol. 3, Iss. 3, 1999-09 ,pp. : 177-189

Elsevier

Access to resources Recommend Favorite

On comparing ray shooting algorithms

By Havran V.   Purgathofer W.  

Computers and Graphics, Vol. 27, Iss. 4, 2003-08 ,pp. : 593-604

Elsevier

Access to resources Recommend Favorite

Algorithms for generating generalized gray codes

By Lee Edward T   Lee Madonna E  

Kybernetes: The International Journal of Systems & Cybernetics, Vol. 28, Iss. 6-7, 1999-06 ,pp. : 837-844

Emerald Group Publishing Ltd

Access to resources Recommend Favorite

Algorithms for computing lengths of chains in integral partition lattices

By Wan H.   Wootton J.C.  

Theoretical Computer Science, Vol. 289, Iss. 1, 2002-10 ,pp. : 783-800

Elsevier

Access to resources Recommend Favorite

Random lattices, threshold phenomena and efficient reduction algorithms

By Akhavi A.  

Theoretical Computer Science, Vol. 287, Iss. 2, 2002-09 ,pp. : 359-385

Elsevier

Access to resources Recommend Favorite