{"payload":{"pageCount":1,"repositories":[{"type":"Public","name":"acdmammoths.github.io","owner":"acdmammoths","isFork":false,"description":"Website for the Amherst College Data* Mammoths Research and Learning Group","allTopics":["datascience","knowledge-discovery","machinelearning","datamining","computerscience","computerscienceeducation"],"primaryLanguage":{"name":"SCSS","color":"#c6538c"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"Apache License 2.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-05-29T15:21:33.223Z"}},{"type":"Public","name":"ROhAN-code","owner":"acdmammoths","isFork":false,"description":"ROhAN: Row-Order Agnostic Null Models for Statistically-sound Knowledge Discovery","allTopics":["data-science","data-mining","markov-chain","knowledge-discovery","kdd","data-mining-algorithms","markov-chain-monte-carlo","pattern-mining","knowledge-discovery-from-data"],"primaryLanguage":{"name":"Java","color":"#b07219"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":1,"license":"GNU General Public License v3.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-04-09T13:27:03.047Z"}},{"type":"Public","name":"alice","owner":"acdmammoths","isFork":false,"description":"MCMC algorithms to sample random bipartite graphs with given left and right degree sequences and BJDM.","allTopics":["data-science","data-mining","knowledge-discovery","data-mining-algorithms","hypothesis-testing","pattern-mining","random-network-generator","monte-carlo-markov-chain","null-models","knowledge-discovery-from-data"],"primaryLanguage":{"name":"Jupyter Notebook","color":"#DA5B0B"},"pullRequestCount":0,"issueCount":0,"starsCount":1,"forksCount":0,"license":"GNU General Public License v3.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-05-15T07:47:41.337Z"}},{"type":"Public","name":"Bavarian-code","owner":"acdmammoths","isFork":false,"description":"Code for the paper \"Bavarian: Betweenness Centrality Approximation with Variance-Aware Rademacher Averages\", by Chloe Wohlgemuth, Cyrus Cousins, and Matteo Riondato, appearing in ACM KDD'21 and ACM TKDD'23","allTopics":["betweenness","rademacher","betweenness-centrality","centrality","randomized-algorithms","rademacher-complexity","centrality-metrics","random-sampling","centrality-measures"],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":1,"license":"Apache License 2.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-03-07T17:23:43.851Z"}},{"type":"Public","name":"SPEck-code","owner":"acdmammoths","isFork":false,"description":"Code for the paper \"SPEck: Mining Statistically-significant Sequential Patterns Efficiently with Exact Sampling\", by Steedman Jenkins, Stefan Walzer-Goldfeld, and Matteo Riondato, appearing in the Data Mining and Knowledge Discovery Special Issue for ECML PKDD'22.","allTopics":["knowledge-discovery","kdd","datamining","datamining-algorithms","java"],"primaryLanguage":{"name":"Java","color":"#b07219"},"pullRequestCount":0,"issueCount":0,"starsCount":1,"forksCount":1,"license":"GNU General Public License v3.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2022-12-06T19:34:49.797Z"}},{"type":"Public","name":"accsthesis","owner":"acdmammoths","isFork":false,"description":"Amherst College Computer Science Honors Thesis LaTeX template","allTopics":[],"primaryLanguage":{"name":"TeX","color":"#3D6117"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"Apache License 2.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2022-11-11T22:03:28.263Z"}},{"type":"Public","name":"datasetgenerator","owner":"acdmammoths","isFork":false,"description":"A porting to modern g++ and C+11 of the IBM Quest dataset generator","allTopics":["datamining","pattern-mining","datamining-algorithms"],"primaryLanguage":{"name":"C","color":"#555555"},"pullRequestCount":0,"issueCount":1,"starsCount":2,"forksCount":4,"license":"Apache License 2.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2022-03-07T15:53:34.560Z"}},{"type":"Public","name":"parallelcubesampling","owner":"acdmammoths","isFork":false,"description":"Implementations of the parallel and sequential cube sampling algorithms presented in the paper \"A Scalable Parallel Algorithm for Balanced Sampling\" (Alexander Lee, Stefan Walzer-Goldfeld, Shukry Zablah, Matteo Riondato, AAAI'22 Student Abstract).","allTopics":["sampling","sampling-methods","parallel-algorithms","balanced-sampling","cubesampling"],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":2,"forksCount":1,"license":"Apache License 2.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2021-11-18T22:38:24.642Z"}},{"type":"Public","name":".github","owner":"acdmammoths","isFork":false,"description":"Special repo.","allTopics":[],"primaryLanguage":null,"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"Apache License 2.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2021-09-21T12:56:09.503Z"}},{"type":"Public","name":"Intellij-Hadoop","owner":"acdmammoths","isFork":true,"description":"Run Hadoop program using Intellij","allTopics":[],"primaryLanguage":{"name":"Java","color":"#b07219"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":21,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2021-04-13T18:54:05.500Z"}}],"repositoryCount":10,"userInfo":null,"searchable":true,"definitions":[],"typeFilters":[{"id":"all","text":"All"},{"id":"public","text":"Public"},{"id":"source","text":"Sources"},{"id":"fork","text":"Forks"},{"id":"archived","text":"Archived"},{"id":"template","text":"Templates"}],"compactMode":false},"title":"Repositories"}