{
    "data_id": "1051",
    "name": "cocomo_numeric",
    "exact_name": "cocomo_numeric",
    "version": 1,
    "version_label": null,
    "description": "**Author**:   \n**Source**: Unknown - Date unknown  \n**Please cite**:   \n\n%-*- text -*-\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\nThis is a PROMISE Software Engineering Repository data set made publicly\navailable in order to encourage repeatable, verifiable, refutable, and\/or\nimprovable predictive models of software engineering.\n\nIf you publish material based on PROMISE data sets then, please\nfollow the acknowledgment guidelines posted on the PROMISE repository\nweb page http:\/\/promise.site.uottawa.ca\/SERepository .\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n1. Title\/Topic: cocomonasa\/software cost estimation\n2. Sources:\n\n-- Creators: 60 NASA projects from different centers\nfor projects from the 1980s and 1990s.  Collected by\nJairus Hihn, JPL, NASA, Manager SQIP Measurement &\nBenchmarking Element\nPhone (818) 354-1248 (Jairus.M.Hihn@jpl.nasa.gov)\n\n-- Donor: Tim Menzies (tim@barmag.net)\n\n-- Date: December 2 2004\n3. Past Usage\n1. \"Validation Methods for Calibrating Software Effort\nModels\", T. Menzies and D. Port and Z. Chen and\nJ. Hihn and S. Stukes, Proceedings ICSE 2005,\nhttp:\/\/menzies.us\/pdf\/04coconut.pdf\n-- Results\n-- Given background knowledge on 60 prior projects,\na new cost model can be tuned to local data using\nas little as 20 new projects.\n-- A very simple calibration method (COCONUT) can\nachieve PRED(30)=7% or PRED(20)=50% (after 20 projects).\nThese are results seen in 30 repeats of an incremental\ncross-validation study.\n-- Two cost models are compared; one based on just\nlines of code and one using over a dozen \"effort\nmultipliers\". Just using lines of code loses 10 to 20\nPRED(N) points.\n\n3.1 Additional Usage:\n2. \"Feature Subset Selection Can Improve Software Cost Estimation Accuracy\"\nZhihao Chen, Tim Menzies, Dan Port and Barry Boehm\nProceedings PROMISE Workshop 2005,\nhttp:\/\/www.etechstyle.com\/chen\/papers\/05fsscocomo.pdf\nP02, P03, P04 are used in this paper.\n-- Results\n-- To the best of our knowledge, this is the first report\nof applying feature subset selection (FSS)\nto software effort data.\n\n-- FSS can dramatically improve cost estimation.\n\n---T-tests are applied to the results to demonstrate\nthat always in our data sets, removing\nattributes improves performance without increasing the\nvariance in model behavior.\n\n4. Relevant Information\n\nThe COCOMO software cost model measures effort in calendar months\nof 152 hours (and includes development and management hours).\nCOCOMO assumes that the effort grows more than linearly on\nsoftware size; i.e. months=a* KSLOC^b*c. Here, \"a\" and \"b\" are\ndomain-specific parameters; \"KSLOC\" is estimated directly or\ncomputed from a function point analysis; and \"c\" is the product\nof over a dozen \"effort multipliers\". I.e.\n\nmonths=a*(KSLOC^b)*(EM1* EM2 * EM3 * ...)\n\nThe effort multipliers are as follows:\n\nincrease | acap | analysts capability\nthese to | pcap | programmers capability\ndecrease  | aexp | application experience\neffort  | modp | modern programing practices\n| tool | use of  software tools\n| vexp | virtual machine experience\n| lexp | language experience\n----------+------+---------------------------\n| sced | schedule constraint\n----------+------+---------------------------\ndecrease | stor | main memory constraint\nthese to | data | data base size\ndecrease | time | time constraint for cpu\neffort | turn | turnaround time\n| virt | machine volatility\n| cplx | process complexity\n| rely | required software reliability\n\nIn COCOMO I, the exponent on KSLOC was a single value ranging from\n1.05 to 1.2.  In COCOMO II, the exponent \"b\" was divided into a\nconstant, plus the sum of five \"scale factors\" which modeled\nissues such as ``have we built this kind of system before?''.  The\nCOCOMO~II effort multipliers are similar but COCOMO~II dropped one\nof the effort multiplier parameters; renamed some others; and\nadded a few more (for \"required level of reuse\", \"multiple-site\ndevelopment\", and \"schedule pressure\").\n\nThe effort multipliers fall into three groups: those that are\npositively correlated to more effort; those that are\nnegatively correlated to more effort; and a third group\ncontaining just schedule information. In COCOMO~I, \"sced\" has a\nU-shaped correlation to effort; i.e. giving programmers either\ntoo much or too little time to develop a system can be\ndetrimental.\n\nThe numeric values of the effort multipliers are:\n\nvery\t\t\t\tvery\textra\tproductivity\nlow\tlow\tnominal\thigh\thigh\thigh\trange\n---------------------------------------------------------------------\nacap\t1.46   \t1.19   \t1.00   \t0.86   \t0.71   \t\t2.06\npcap\t1.42.  \t1.17   \t1.00   \t0.86   \t0.70 \t\t1.67\naexp   \t1.29   \t1.13   \t1.00   \t0.91   \t0.82   \t\t1.57\nmodp   \t1.24.  \t1.10 \t1.00 \t0.91 \t0.82 \t\t1.34\ntool   \t1.24 \t1.10 \t1.00 \t0.91 \t0.83 \t\t1.49\nvexp   \t1.21 \t1.10 \t1.00 \t0.90 \t  \t\t1.34\nlexp   \t1.14 \t1.07 \t1.00 \t0.95 \t  \t\t1.20\nsced   \t1.23 \t1.08 \t1.00 \t1.04 \t1.10 \t  \te\nstor   \t       \t       \t1.00   \t1.06   \t1.21   \t1.56\t-1.21\ndata   \t    \t 0.94 \t1.00 \t1.08 \t1.16\t\t-1.23\ntime   \t  \t    \t1.00   \t1.11   \t1.30   \t1.66\t-1.30\nturn   \t       \t0.87   \t1.00   \t1.07   \t1.15   \t\t-1.32\nvirt   \t       \t0.87   \t1.00   \t1.15   \t1.30   \t\t-1.49\nrely   \t0.75\t 0.88\t 1.00 \t 1.15 \t 1.40\t\t-1.87\ncplx   \t0.70 \t0.85 \t1.00 \t1.15 \t1.30 \t1.65\t-2.36\n\nThese were learnt by Barry Boehm after a regression analysis of the\nprojects in the COCOMO I data set.\n@Book{boehm81,\nAuthor    =\t \"B. Boehm\",\nTitle     =\t \"Software Engineering Economics\",\nPublisher =\t \"Prentice Hall\",\nYear      =\t 1981}\n\nThe last column of the above table shows max(E)\/min(EM) and shows\nthe overall effect of a single effort multiplier. For example,\nincreasing \"acap\" (analyst experience) from very low to very\nhigh will most decrease effort while increasing \"rely\"\n(required reliability) from very low to very high will most\nincrease effort.\n\nThere is much more to COCOMO that the above description. The\nCOCOMO~II text is over 500 pages long and offers\nall the details needed to implement data capture and analysis of\nCOCOMO in an industrial context.\n@Book{boehm00b,\nAuthor = \"Barry Boehm and Ellis Horowitz and Ray Madachy and\nDonald Reifer and Bradford K. Clark and Bert Steece\nand A. Winsor Brown and Sunita Chulani and Chris Abts\",\nTitle = \"Software Cost Estimation with Cocomo II\",\nPublisher = \"Prentice Hall\",\nYear = 2000,\nibsn = \"0130266922\"}\n\nIncluded in that book is not just an effort model but other\nmodels for schedule, risk, use of COTS, etc.  However, most\n(?all) of the validation work on COCOMO has focused on the effort\nmodel.\n@article{chulani99,\nauthor =\t \"S. Chulani and B. Boehm and B. Steece\",\ntitle =\t \"Bayesian Analysis of Empirical Software Engineering\nCost Models\",\njournal =\t \"IEEE Transaction on Software Engineering\",\nvolume =\t 25,\nnumber =\t 4,\nmonth =\t \"July\/August\",\nyear =\t \"1999\"}\n\nThe value of an effort predictor can be reported many ways\nincluding MMRE and PRED(N).MMRE and PRED are computed from the\nrelative error, or RE, which is the relative size of the\ndifference between the actual and estimated value:\n\nRE.i = (estimate.i - actual.i) \/ (actual.i)\n\nGiven a data set of of size \"D\", a \"Train\"ing set of size\n\"(X=|Train|) <= D\", and a \"test\" set of size \"T=D-|Train|\", then\nthe mean magnitude of the relative error, or MMRE, is the\npercentage of the absolute values of the relative errors,\naveraged over the \"T\" items in the \"Test\" set; i.e.\n\nMRE.i  = abs(RE.i)\nMMRE.i = 100\/T*( MRE.1 + MRE.2 + ... + MRE.T)\n\nPRED(N) reports the average percentage of estimates that were\nwithin N% of the actual values:\n\ncount=0\nfor(i=1;i<=T;i++) do if (MRE.i <= N\/100) then count++ fi done\nPRED(N) = 100\/T * sum\n\nFor example, e.g. PRED(30)=50% means that half the estimates are\nwithin 30% of the actual.  Shepperd and Schofield comment that\n\"MMRE is fairly conservative with a bias against overestimates\nwhile Pred(25) will identify those prediction systems that are\ngenerally accurate but occasionally wildly inaccurate\".\n@article{shepperd97,\nauthor=\"M. Shepperd and C. Schofield\",\ntitle=\"Estimating Software Project Effort Using Analogies\",\njournal=\"IEEE Transactions on Software Engineering\",\nvolume=23,\nnumber=12,\nmonth=\"November\",\nyear=1997,\nnote=\"Available from\n\\url{http:\/\/www.utdallas.edu\/~rbanker\/SE_XII.pdf}\"}\n\n4.1 Further classification of the projects\n\n4.1.1 Classify the projects into different project categories - P02, P03, P04.\n(The criteria is unknown and they are disjoint.)\n\nCategory\tsequence Original sequence_of_NASA\nP01\t1\tNASA\t26\nP01\t2\tNASA\t27\nP01\t3\tNASA\t28\nP01\t4\tNASA\t29\nP01\t5\tNASA\t30\nP01\t6\tNASA\t31\nP01\t7\tNASA\t32\nP02\t1\tNASA\t4\nP02\t2\tNASA\t5\nP02\t3\tNASA\t6\nP02\t4\tNASA\t7\nP02\t5\tNASA\t8\nP02\t6\tNASA\t9\nP02\t7\tNASA\t10\nP02\t8\tNASA\t11\nP02\t9\tNASA\t12\nP02\t10\tNASA\t13\nP02\t11\tNASA\t14\nP02\t12\tNASA\t15\nP02\t13\tNASA\t16\nP02\t14\tNASA\t17\nP02\t15\tNASA\t18\nP02\t16\tNASA\t19\nP02\t17\tNASA\t20\nP02\t18\tNASA\t21\nP02\t19\tNASA\t22\nP02\t20\tNASA\t23\nP02\t21\tNASA\t24\nP02\t22\tNASA\t25\nP03\t1\tNASA\t34\nP03\t2\tNASA\t35\nP03\t3\tNASA\t36\nP03\t4\tNASA\t37\nP03\t5\tNASA\t38\nP03\t6\tNASA\t39\nP03\t7\tNASA\t40\nP03\t8\tNASA\t41\nP03\t9\tNASA\t42\nP03\t10\tNASA\t43\nP03\t11\tNASA\t44\nP03\t12\tNASA\t45\nP04\t1\tNASA\t47\nP04\t2\tNASA\t48\nP04\t3\tNASA\t49\nP04\t4\tNASA\t50\nP04\t5\tNASA\t51\nP04\t6\tNASA\t52\nP04\t7\tNASA\t53\nP04\t8\tNASA\t54\nP04\t9\tNASA\t55\nP04\t10\tNASA\t56\nP04\t11\tNASA\t57\nP04\t12\tNASA\t58\nP04\t13\tNASA\t59\nP04\t14\tNASA\t60\n\n4.1.2 Classify the projects into different task categories - T01, T02, T03.\n(The criteria is unknown and they are disjoint.)\nT01:sequencing  T02:avionics    T03:missionPlanning\n\nCategory\tsequence Original sequence_of_NASA\nT01\t1\tNASA\t43\nT01\t2\tNASA\t41\nT01\t3\tNASA\t37\nT01\t4\tNASA\t34\nT01\t5\tNASA\t40\nT01\t6\tNASA\t38\nT01\t7\tNASA\t39\nT01\t8\tNASA\t36\nT02\t1\tNASA\t4\nT02\t2\tNASA\t6\nT02\t3\tNASA\t26\nT02\t4\tNASA\t27\nT02\t5\tNASA\t33\nT02\t6\tNASA\t32\nT02\t7\tNASA\t29\nT02\t8\tNASA\t30\nT02\t9\tNASA\t28\nT02\t10\tNASA\t7\nT02\t11\tNASA\t9\nT02\t12\tNASA\t10\nT02\t13\tNASA\t55\nT02\t14\tNASA\t31\nT03\t1\tNASA\t51\nT03\t2\tNASA\t52\nT03\t3\tNASA\t16\nT03\t4\tNASA\t17\nT03\t5\tNASA\t8\nT03\t6\tNASA\t50\nT03\t7\tNASA\t53\nT03\t8\tNASA\t45\nT03\t9\tNASA\t48\nT03\t10\tNASA\t47\n\n4.1.3 Classify the projects into different Centers - C01, C02, C03.\n(The criteria is unknown and they are disjoint.)\nCategory sequence Original sequence_of_NASA\n\nC01\t1\tNASA\t1\nC01\t2\tNASA\t2\nC01\t3\tNASA\t51\nC01\t4\tNASA\t52\nC01\t5\tNASA\t50\nC01\t6\tNASA\t53\nC01\t7\tNASA\t48\nC01\t8\tNASA\t47\nC01\t9\tNASA\t58\nC01\t10\tNASA\t59\nC01\t11\tNASA\t60\nC01\t12\tNASA\t49\nC01\t13\tNASA\t54\nC02\t1\tNASA\t45\nC02\t2\tNASA\t43\nC02\t3\tNASA\t41\nC02\t4\tNASA\t35\nC02\t5\tNASA\t34\nC02\t6\tNASA\t40\nC02\t7\tNASA\t38\nC02\t8\tNASA\t39\nC02\t9\tNASA\t36\nC02\t10\tNASA\t37\nC02\t11\tNASA\t42\nC02\t12\tNASA\t44\nC03\t1\tNASA\t4\nC03\t2\tNASA\t6\nC03\t3\tNASA\t26\nC03\t4\tNASA\t27\nC03\t5\tNASA\t33\nC03\t6\tNASA\t32\nC03\t7\tNASA\t29\nC03\t8\tNASA\t30\nC03\t9\tNASA\t28\nC03\t10\tNASA\t7\nC03\t11\tNASA\t9\nC03\t12\tNASA\t10\nC03\t13\tNASA\t31\nC03\t14\tNASA\t21\nC03\t15\tNASA\t14\nC03\t16\tNASA\t22\nC03\t17\tNASA\t3\nC03\t18\tNASA\t19\nC03\t19\tNASA\t16\nC03\t20\tNASA\t17\nC03\t21\tNASA\t8\nC03\t22\tNASA\t23\nC03\t23\tNASA\t20\nC03\t24\tNASA\t24\nC03\t25\tNASA\t12\nC03\t26\tNASA\t5\nC03\t27\tNASA\t13\nC03\t28\tNASA\t25\nC03\t29\tNASA\t15\nC03\t30\tNASA\t18\nC03\t31\tNASA\t11\n5. Number of instances: 60\n6. Number of attributes: 17 (15 discrete in the range Very_Low to\nExtra_High; one lines of code measure, and one goal field\nbeing the actual effort in person months).\n7. Attribute information:\n8. Missing attributes: none\n9: Class distribution: the class value (ACT_EFFORT) is continuous.\nAfter sorting all the instances on ACT_EFFORT, the following\ndistribution was found:\nInstances     Range\n---------     --------------\n1..10         8.4 ..   42\n11..20        48   ..   68\n21..30        70   ..  117.6\n31..40       120   ..  300\n41..50       324   ..  571\n51..60       750   .. 3240\nChange log:\n-----------\n\n2005\/04\/04 Jelber Sayyad Shirabad (PROMISE Librarian) <promise@site.uottawa.ca>\n1) Minor editorial changes, as well as moving the information provided by\nZhihao Chen to the new sections 3.1 and 4.1\n\n2005\/03\/28 Zhihao Chen, CSE, USC, USA, <zhihaoch@cse.usc.edu>\n1) Fix a mistake in line corresponding to cplx entry in the table of \"The numeric values of the effort multipliers\"\n\"cplx   \t0.70 \t0.85 \t1.00 \t1.15 \t1.30 \t1.65\t-1.86\" should be\n\"cplx   \t0.70 \t0.85 \t1.00 \t1.15 \t1.30 \t1.65\t-2.36\"\n\n2) Additional information about various classifications of the projects are provided.\n\n3) Additional usage information is provided",
    "format": "ARFF",
    "uploader": "Joaquin Vanschoren",
    "uploader_id": 2,
    "visibility": "public",
    "creator": "Jairus Hihn",
    "contributor": null,
    "date": "2014-10-06 23:57:15",
    "update_comment": null,
    "last_update": "2014-10-06 23:57:15",
    "licence": "Public",
    "status": "active",
    "error_message": null,
    "url": "https:\/\/www.openml.org\/data\/download\/53934\/cocomo_numeric.arff",
    "kaggle_url": null,
    "default_target_attribute": "ACT_EFFORT",
    "row_id_attribute": null,
    "ignore_attribute": null,
    "runs": 2,
    "suggest": {
        "input": [
            "cocomo_numeric",
            "%-*- text -*- %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% This is a PROMISE Software Engineering Repository data set made publicly available in order to encourage repeatable, verifiable, refutable, and\/or improvable predictive models of software engineering. If you publish material based on PROMISE data sets then, please follow the acknowledgment guidelines posted on the PROMISE repository web page http:\/\/promise.site.uottawa.ca\/SERepository . %%%%%%%%%%%%%%%%%%%%%% "
        ],
        "weight": 5
    },
    "qualities": {
        "NumberOfInstances": 60,
        "NumberOfFeatures": 17,
        "NumberOfClasses": 0,
        "NumberOfMissingValues": 0,
        "NumberOfInstancesWithMissingValues": 0,
        "NumberOfNumericFeatures": 2,
        "NumberOfSymbolicFeatures": 15,
        "Quartile3MutualInformation": null,
        "CfsSubsetEval_DecisionStumpErrRate": null,
        "RandomTreeDepth2ErrRate": null,
        "J48.00001.Kappa": null,
        "MeanAttributeEntropy": null,
        "MinorityClassSize": null,
        "PercentageOfSymbolicFeatures": 88.23529411764706,
        "Quartile3SkewnessOfNumericAtts": 2.6815951523530615,
        "CfsSubsetEval_DecisionStumpKappa": null,
        "RandomTreeDepth2Kappa": null,
        "J48.0001.AUC": null,
        "MeanKurtosisOfNumericAtts": 5.308489298730005,
        "NaiveBayesAUC": null,
        "Quartile1AttributeEntropy": null,
        "Quartile3StdDevOfNumericAtts": 656.9656698371939,
        "CfsSubsetEval_NaiveBayesAUC": null,
        "RandomTreeDepth3AUC": null,
        "J48.0001.ErrRate": null,
        "MeanMeansOfNumericAtts": 240.50083333333333,
        "NaiveBayesErrRate": null,
        "Quartile1KurtosisOfNumericAtts": 3.2916122242424835,
        "REPTreeDepth1AUC": null,
        "CfsSubsetEval_NaiveBayesErrRate": null,
        "RandomTreeDepth3ErrRate": null,
        "J48.0001.Kappa": null,
        "MeanMutualInformation": null,
        "NaiveBayesKappa": null,
        "Quartile1MeansOfNumericAtts": 74.58833333333332,
        "REPTreeDepth1ErrRate": null,
        "CfsSubsetEval_NaiveBayesKappa": null,
        "RandomTreeDepth3Kappa": null,
        "J48.001.AUC": null,
        "MeanNoiseToSignalRatio": null,
        "NumberOfBinaryFeatures": 0,
        "Quartile1MutualInformation": null,
        "REPTreeDepth1Kappa": null,
        "CfsSubsetEval_kNN1NAUC": null,
        "StdvNominalAttDistinctValues": 0.7237468644557459,
        "J48.001.ErrRate": null,
        "MeanNominalAttDistinctValues": 3.6666666666666665,
        "Quartile1SkewnessOfNumericAtts": 1.929843183891309,
        "REPTreeDepth2AUC": null,
        "CfsSubsetEval_kNN1NErrRate": null,
        "kNN1NAUC": null,
        "J48.001.Kappa": null,
        "MeanSkewnessOfNumericAtts": 2.3057191681221854,
        "Quartile1StdDevOfNumericAtts": 97.1720893380794,
        "REPTreeDepth2ErrRate": null,
        "CfsSubsetEval_kNN1NKappa": null,
        "kNN1NErrRate": null,
        "MajorityClassPercentage": null,
        "MeanStdDevOfNumericAtts": 377.0688795876366,
        "Quartile2AttributeEntropy": null,
        "Quartile2KurtosisOfNumericAtts": 5.308489298730006,
        "REPTreeDepth2Kappa": null,
        "ClassEntropy": null,
        "kNN1NKappa": null,
        "MajorityClassSize": null,
        "MinAttributeEntropy": null,
        "Quartile2MeansOfNumericAtts": 240.50083333333333,
        "REPTreeDepth3AUC": null,
        "DecisionStumpAUC": null,
        "MaxAttributeEntropy": null,
        "MinKurtosisOfNumericAtts": 3.2916122242424835,
        "Quartile2MutualInformation": null,
        "REPTreeDepth3ErrRate": null,
        "DecisionStumpErrRate": null,
        "MaxKurtosisOfNumericAtts": 7.325366373217527,
        "MinMeansOfNumericAtts": 74.58833333333332,
        "Quartile2SkewnessOfNumericAtts": 2.3057191681221854,
        "REPTreeDepth3Kappa": null,
        "DecisionStumpKappa": null,
        "MaxMeansOfNumericAtts": 406.4133333333333,
        "MinMutualInformation": null,
        "Quartile2StdDevOfNumericAtts": 377.0688795876366,
        "RandomTreeDepth1AUC": null,
        "Dimensionality": 0.2833333333333333,
        "MaxMutualInformation": null,
        "MinNominalAttDistinctValues": 3,
        "PercentageOfBinaryFeatures": 0,
        "Quartile3AttributeEntropy": null,
        "RandomTreeDepth1ErrRate": null,
        "EquivalentNumberOfAtts": null,
        "MaxNominalAttDistinctValues": 5,
        "MinSkewnessOfNumericAtts": 1.929843183891309,
        "PercentageOfInstancesWithMissingValues": 0,
        "Quartile3KurtosisOfNumericAtts": 7.325366373217527,
        "AutoCorrelation": -344.257627118644,
        "RandomTreeDepth1Kappa": null,
        "J48.00001.AUC": null,
        "MaxSkewnessOfNumericAtts": 2.6815951523530615,
        "MinStdDevOfNumericAtts": 97.1720893380794,
        "PercentageOfMissingValues": 0,
        "Quartile3MeansOfNumericAtts": 406.4133333333333,
        "CfsSubsetEval_DecisionStumpAUC": null,
        "RandomTreeDepth2AUC": null,
        "J48.00001.ErrRate": null,
        "MaxStdDevOfNumericAtts": 656.9656698371939,
        "MinorityClassPercentage": null,
        "PercentageOfNumericFeatures": 11.76470588235294
    },
    "tags": [
        {
            "uploader": "38960",
            "tag": "Data Science"
        },
        {
            "uploader": "38960",
            "tag": "Engineering"
        },
        {
            "uploader": "24659",
            "tag": "PROMISE"
        }
    ],
    "features": [
        {
            "name": "ACT_EFFORT",
            "index": "16",
            "type": "numeric",
            "distinct": "49",
            "missing": "0",
            "target": "1",
            "min": "8",
            "max": "3240",
            "mean": "406",
            "stdev": "657"
        },
        {
            "name": "RELY",
            "index": "0",
            "type": "nominal",
            "distinct": "4",
            "missing": "0",
            "distr": []
        },
        {
            "name": "DATA",
            "index": "1",
            "type": "nominal",
            "distinct": "4",
            "missing": "0",
            "distr": []
        },
        {
            "name": "CPLX",
            "index": "2",
            "type": "nominal",
            "distinct": "5",
            "missing": "0",
            "distr": []
        },
        {
            "name": "TIME",
            "index": "3",
            "type": "nominal",
            "distinct": "4",
            "missing": "0",
            "distr": []
        },
        {
            "name": "STOR",
            "index": "4",
            "type": "nominal",
            "distinct": "4",
            "missing": "0",
            "distr": []
        },
        {
            "name": "VIRT",
            "index": "5",
            "type": "nominal",
            "distinct": "3",
            "missing": "0",
            "distr": []
        },
        {
            "name": "TURN",
            "index": "6",
            "type": "nominal",
            "distinct": "3",
            "missing": "0",
            "distr": []
        },
        {
            "name": "ACAP",
            "index": "7",
            "type": "nominal",
            "distinct": "3",
            "missing": "0",
            "distr": []
        },
        {
            "name": "AEXP",
            "index": "8",
            "type": "nominal",
            "distinct": "3",
            "missing": "0",
            "distr": []
        },
        {
            "name": "PCAP",
            "index": "9",
            "type": "nominal",
            "distinct": "3",
            "missing": "0",
            "distr": []
        },
        {
            "name": "VEXP",
            "index": "10",
            "type": "nominal",
            "distinct": "3",
            "missing": "0",
            "distr": []
        },
        {
            "name": "LEXP",
            "index": "11",
            "type": "nominal",
            "distinct": "4",
            "missing": "0",
            "distr": []
        },
        {
            "name": "MODP",
            "index": "12",
            "type": "nominal",
            "distinct": "4",
            "missing": "0",
            "distr": []
        },
        {
            "name": "TOOL",
            "index": "13",
            "type": "nominal",
            "distinct": "5",
            "missing": "0",
            "distr": []
        },
        {
            "name": "SCED",
            "index": "14",
            "type": "nominal",
            "distinct": "3",
            "missing": "0",
            "distr": []
        },
        {
            "name": "LOC",
            "index": "15",
            "type": "numeric",
            "distinct": "55",
            "missing": "0",
            "min": "2",
            "max": "423",
            "mean": "75",
            "stdev": "97"
        }
    ],
    "nr_of_issues": 0,
    "nr_of_downvotes": 0,
    "nr_of_likes": 0,
    "nr_of_downloads": 0,
    "total_downloads": 0,
    "reach": 0,
    "reuse": 0,
    "impact_of_reuse": 0,
    "reach_of_reuse": 0,
    "impact": 0
}