Ohloh by Black Duck

 Follow @ Meta   Join Now

 

Projects

Browse Projects By Tags Add a New Project
Selected Tags
Related Tags

Browsing projects by Tag(s)

Select a tag to browse associated projects and drill deeper into the tag cloud.

Showing page 1 of 1

slatt

Compare

Association mining has a number of algorithmic variants that are conveniently run on top of a lattice-theoretic structure. Slatt will provide such lattices with some convenience operations and implement some ways to facilitate mining optimum-size bases of association rules. Not intended yet for ... [More] practical data mining projects, rather as experimental platform to discuss the advantages of each of several academic proposals to select the interesting association rules among the myriad of rules that benchmark datasets usually produce. [Less]

0
 
  0 reviews  |  0 users  |  1,545 lines of code  |  1 current contributor  |  Analyzed 6 days ago
  python association_mining association_rules lattices data_mining
 
 

fkt

Compare

An implementation of the FKT algorithm for counting the number of perfect matchings in a graph. Written using the Gforth programming language.

0
 
  0 reviews  |  0 users  |  3,190 lines of code  |  1 current contributor  |  Analyzed about 2 hours ago
  counting lattices algorithms graphtheory forth math graphtheoreticalproblems gforth
 
 
 
 

Creative Commons License Copyright © 2013 Black Duck Software, Inc. and its contributors, Some Rights Reserved. Unless otherwise marked, this work is licensed under a Creative Commons Attribution 3.0 Unported License . Ohloh ® and the Ohloh logo are trademarks of Black Duck Software, Inc. in the United States and/or other jurisdictions. All other trademarks are the property of their respective holders.