package ca.pfv.spmf.algorithms.frequentpatterns.two_phase;
/* This file is copyright (c) 2008-2013 Philippe Fournier-Viger
*
* This file is part of the SPMF DATA MINING SOFTWARE
* (http://www.philippe-fournier-viger.com/spmf).
*
* SPMF 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 3 of the License, or (at your option) any later
* version.
*
* SPMF 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
* SPMF. If not, see .
*/
import java.util.List;
/**
* This class represents a transaction (a set of items) from a transaction
* database with utility values, as used by the Two-Phase algorithm for high
* utility itemset mining.
*
* @see AlgoTwoPhase
* @see UtilityTransactionDatabaseTP
*
* @author Philippe Fournier-Viger
*/
public class TransactionTP{
// a transaction is an ordered list of items
private final List items;
// the utility values corresponding to the items
private final List itemsUtilities;
// the total transaction utility (TU)
private final int transactionUtility;
/**
* Constructor
* @param items list of items
* @param itemsUtilities list of corresponding utility values
* @param transactionUtility the transaction utility
*/
public TransactionTP(List items, List itemsUtilities, int transactionUtility){
this.items = items;
this.itemsUtilities = itemsUtilities;
this.transactionUtility = transactionUtility;
}
/**
* Get the list of items.
* @return a list of items (Integer)
*/
public List getItems(){
return items;
}
/**
* Get the item at a given position.
* @param index the position
* @return the item
*/
public Integer get(int index){
return items.get(index);
}
/**
* Print the transaction to System.out
*/
public void print(){
System.out.print(toString());
}
/**
* Return a string representation of this transaction.
*/
public String toString(){
// create a string buffer
StringBuffer r = new StringBuffer ();
// append all items
for(int i=0; i< items.size(); i++){
r.append(items.get(i) + " ");
if(i == items.size() -1){
r.append(":");
}
}
// append the transaction utility
r.append(transactionUtility + ": ");
// append the item utility values
for(int i=0; i< itemsUtilities.size(); i++){
r.append(itemsUtilities.get(i) + " ");
}
// return the buffer as a string
return r.toString();
}
/**
* Check if this transaction contains an item.
* @param item the given item
* @return true if yes, otherwise false.
*/
public boolean contains(Integer item) {
// for each item in the transaction
for(Integer itemI : items){
// if found, return true
if(itemI.equals(item)){
return true;
}else if(itemI > item){
// if the current item is larger, then the item will not be found
// because of lexical order so return false
return false;
}
}
// if not found, return false
return false;
}
/**
* Check if this transaction contains an item.
* @param item the given item
* @return true if yes, otherwise false.
*/
public boolean contains(int item) {
// for each item in the transaction
for(int i=0; i item){
// if the current item is larger, then the item will not be found
// because of lexical order so return false
return false;
}
}
// if not found, return false
return false;
}
/**
* Get the number of items in this transaction.
* @return the item count
*/
public int size(){
return items.size();
}
/**
* Get the item utilities for this transaction.
* @return a list containing the item utilities
*/
public List getItemsUtilities() {
return itemsUtilities;
}
/**
* Get the transaction utility of this transaction.
* @return an integer
*/
public int getTransactionUtility() {
return transactionUtility;
}
}
Ads help maintain this website.