The algorithm underlying MoSS is inspired by the Eclat algorithmįor frequent item set mining (although itĭoes not intersect transaction lists) and was first published inĪpart from the default MoSS/MoFa algorithm, this program also contains Substructures discriminate between the two parts of the databaseĪnd thus may be called discriminative fragments. The same frequency), but with no more than a user-specified maximumįrequency in the complement part of the database. Part of the database (and do not have super-structures that occur with Of the database, but rare in the complement part, that is, thatĪppear with at least a user-specified minimum frequency in the focus It finds molecular fragments that are frequent in the focus part Super-structures that occur with the same frequency). User-specified minimum frequency in the database (and do not have Substructures, that is, all substructures that appear with a Given a database of graphs, MoSS finds all (closed) frequent In theįollowing it is generally assumed that the input is a set of Though, and they are not described in this documentation. Such general attributed graphs is currently still fairly limited, Molecular data sets, but can mine arbitrary data sets of attributed However, since Miner version 5.3, MoSS is no longer restricted to It can be used in the context of drug discovery and synthesis predictionįor the purpose of analyzing the outcome of screening tests. MoSS is mainly a program to find frequent molecular substructuresĪnd discriminative fragments in a database of molecule descriptions. Older versions of the program may differ in some aspects. This documentation refers to GUI version 2.5 (2011.02.24)Īnd Miner version 6.2 (2011.02.24) of the MoSS program. MoSS Documentation MoSS Molecular Substructure Miner
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |