<commit_before>/*----------------------------------------------------------------------------*/
/*                                                                            */
/*   Copyright (c) 2015 data-fetish                                           */
/*   All rights reserved.                                                     */
/*                                                                            */
/*   Team: Knowledge-mining                                                   */
/*                                                                            */
/*   Authors:  <NAME>                                                  */
/*             <NAME>                                               */
/*             <NAME>                                                  */
/*                                                                            */
/*----------------------------------------------------------------------------*/

/*
    FP-Growth Algorithm
    main.c
*/


#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <ctype.h>

#include "FP_TREE_GEN.c"


int main()
{
  /*
     - get the min support count or percentage from user
       
     - FP-Tree-Generation
       - generate frequent itemset 
       - sort the input transactions in descending order based on frequent itemset support count
       - create the FP-tree

     - FP-Growth

  */

//  long long minSupportCount = 0;

  printf( "Enter the minimum support count: " );
  scanf( "%lld", &minSupportCount );

  //FP_Tree_Generation();
  FP_Tree_generate();
  //FP_Growth();

  return 0;
}


<commit_msg>modified to generate freq itemsets<commit_after>/*----------------------------------------------------------------------------*/
/*                                                                            */
/*   Copyright (c) 2015 data-fetish                                           */
/*   All rights reserved.                                                     */
/*                                                                            */
/*   Team: Knowledge-mining                                                   */
/*                                                                            */
/*   Authors:  <NAME>                                                  */
/*             <NAME>                                               */
/*             <NAME>                                                  */
/*                                                                            */
/*----------------------------------------------------------------------------*/

/*
    FP-Growth Algorithm
    main.c
*/

//#pragma once
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <ctype.h>

//#include "FP_TREE_GEN.c"
#include "FP_GROWTH.cpp"

int main()
{
  /*
     - get the min support count or percentage from user
       
     - FP-Tree-Generation
       - generate frequent itemset 
       - sort the input transactions in descending order based on frequent itemset support count
       - create the FP-tree

     - FP-Growth

  */

//  long long minSupportCount = 0;

  printf( "Enter the minimum support count: " );
  scanf( "%lld", &minSupportCount );

  //FP_Tree_Generation();
  FP_Tree_generate();
  //FP_Growth();

  //checkPrinter();

  tree_growth();

  return 0;
}



{'fraction_non_alphanumeric': 0.17940298507462688, 'fraction_numerical': 0.003582089552238806, 'mean_word_length': 0.6157184185149469, 'pattern_counts': {'":': 0, '<': 17, '<?xml version=': 0, '>': 17, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 48, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '6823069', 'n_tokens_mistral': 683, 'n_tokens_neox': 620, 'n_words': 164}