📄 customersequentialdecompbuild.java
字号:
/*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
*/
/**
* Title: XELOPES Data Mining Library
* Description: The XELOPES library is an open platform-independent and data-source-independent library for Embedded Data Mining.
* Copyright: Copyright (c) 2002 Prudential Systems Software GmbH
* Company: ZSoft (www.zsoft.ru), Prudsys (www.prudsys.com)
* @author Carsten Weisse
* @author Michael Thess
* @version 1.0
*/
package com.prudsys.pdm.Examples;
import java.io.FileWriter;
import com.prudsys.pdm.Core.CategoricalAttribute;
import com.prudsys.pdm.Core.MiningAlgorithmSpecification;
import com.prudsys.pdm.Core.MiningDataSpecification;
import com.prudsys.pdm.Core.MiningException;
import com.prudsys.pdm.Core.MiningModel;
import com.prudsys.pdm.Core.NumericAttribute;
import com.prudsys.pdm.Input.MiningInputStream;
import com.prudsys.pdm.Input.Records.Arff.MiningArffStream;
import com.prudsys.pdm.Models.CustomerSeq.CustomerSequentialAlgorithm;
import com.prudsys.pdm.Models.CustomerSeq.CustomerSequentialMiningModel;
import com.prudsys.pdm.Models.CustomerSeq.CustomerSequentialSettings;
import com.prudsys.pdm.Utils.GeneralUtils;
import com.prudsys.pdm.Utils.PmmlUtils;
/**
* Builds a sequential basket analysis model using decomposition and writes it to
* PMML file 'CustomerSequentialModel.xml'.
*/
public class CustomerSequentialDecompBuild extends BasisExample {
/**
* Empty constructor.
*/
public CustomerSequentialDecompBuild() {
}
/**
* Run the example of this class.
*
* @throws Exception error while example is running
*/
public void runExample() throws Exception {
// Open data source and get metadata:
MiningInputStream inputData = new MiningArffStream( "data/arff/custom-transact.arff" );
MiningDataSpecification metaData = inputData.getMetaData();
// Get transactional attributes:
CategoricalAttribute categoryItemId = (CategoricalAttribute)metaData.getMiningAttribute( "itemId" );
CategoricalAttribute categoryCustomerId = (CategoricalAttribute)metaData.getMiningAttribute( "customerId" );
NumericAttribute categoryTransactionPosition = (NumericAttribute)metaData.getMiningAttribute( "transactionPosition" );
// Use unstored categories mode:
categoryCustomerId.setUnstoredCategories(true);
// Create MiningSettings object and assign metadata:
CustomerSequentialSettings miningSettings = new CustomerSequentialSettings();
miningSettings.setDataSpecification( metaData );
// Assign settings:
miningSettings.setItemId( categoryItemId );
miningSettings.setCustomerId( categoryCustomerId );
miningSettings.setTransactionPosition( categoryTransactionPosition );
miningSettings.setMinimumSupport( 0.35 );
miningSettings.setGenerateRules(true);
miningSettings.setMinimumConfidence(0.3);
miningSettings.verifySettings();
// Get default mining algorithm specification from 'algorithms.xml':
MiningAlgorithmSpecification miningAlgorithmSpecification =
MiningAlgorithmSpecification.getMiningAlgorithmSpecification( "CustomerSequentialDecomposition", null );
if( miningAlgorithmSpecification == null )
throw new MiningException( "Can't find application CustomerSequentialDecompisition." );
// Get class name from algorithms specification:
String className = miningAlgorithmSpecification.getClassname();
if( className == null )
throw new MiningException( "classname attribute expected." );
// Set and display mining algorithm specification parameters:
miningAlgorithmSpecification.setMAPValue("minimumItemSize", "1");
miningAlgorithmSpecification.setMAPValue("maximumItemSize", "-1");
miningAlgorithmSpecification.setMAPValue("doPruning", "false");
miningAlgorithmSpecification.setMAPValue("decompSize", "3");
miningAlgorithmSpecification.setMAPValue("skipLastDomain", "false");
GeneralUtils.displayMiningAlgSpecParameters(miningAlgorithmSpecification);
// Create algorithm object with default values:
CustomerSequentialAlgorithm algorithm = (CustomerSequentialAlgorithm)
GeneralUtils.createMiningAlgorithmInstance(className);
// Put it all together:
algorithm.setMiningInputStream( inputData );
algorithm.setMiningSettings( miningSettings );
algorithm.setMiningAlgorithmSpecification( miningAlgorithmSpecification );
algorithm.verify();
// Build the mining model:
MiningModel model = algorithm.buildModel();
System.out.println("calculation time [s]: " + algorithm.getTimeSpentToBuildModel());
// Show results:
CustomerSequentialBuild.showRules((CustomerSequentialMiningModel) model);
// Write to PMML:
FileWriter writer = new FileWriter("data/pmml/CustomerSequentialModel.xml");
model.writePmml(writer);
// Show in browser:
if (debug == 2) PmmlUtils.openPmmlBrowser("CustomerSequentialModel.xml");
}
/**
* Example of building a sequential basket analysis model using decomposition.
*
* @param args arguments (ignored)
*/
public static void main(String[] args) {
try {
new CustomerSequentialDecompBuild().runExample();
}
catch (Exception ex) {
ex.printStackTrace();
}
}
}
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -