EconPapers    
Economics at your fingertips  
 

Pattern Mining for Historical Data Analysis by Using MOEA

Hiroyuki Morita () and Takanobu Nakahara ()
Additional contact information
Hiroyuki Morita: Economics, Osaka Prefecture University
Takanobu Nakahara: Economics, Osaka Prefecture University

A chapter in Multiobjective Programming and Goal Programming, 2009, pp 135-144 from Springer

Abstract: Abstract In data mining, graph mining is a promising new approach and some algorithms are proposed. However, their application is limited in the field of business. This is because of the wide diversity of business data. In this paper, we propose a method which extracts new valuable patterns by using graph mining approach and MOEA. In our method, historical purchasing data for each customer is transformed into tree structured data and gene is constructed from the structured data at first. Then the patterns are extracted by using existing MOEA from these genes. We apply our proposed method to a practical business data. From computational experiments, we show that our method has good performance and is able to extract valuable patterns from the view of business.

Keywords: Business data; Data mining; Graph mining; MOEA; Tree structured data (search for similar items in EconPapers)
Date: 2009
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:lnechp:978-3-540-85646-7_13

Ordering information: This item can be ordered from
http://www.springer.com/9783540856467

DOI: 10.1007/978-3-540-85646-7_13

Access Statistics for this chapter

More chapters in Lecture Notes in Economics and Mathematical Systems from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().

 
Page updated 2025-04-01
Handle: RePEc:spr:lnechp:978-3-540-85646-7_13