Menu
Home
Contact us
Stats
Categories
Calendar
Toggle Wiki
Wiki Home
Last Changes
Rankings
List pages
Orphan pages
Sandbox
Print
Toggle Image Galleries
Galleries
Rankings
Toggle Articles
Articles home
List articles
Rankings
Toggle Blogs
List blogs
Rankings
Toggle Forums
List forums
Rankings
Toggle File Galleries
List galleries
Rankings
Toggle Maps
Mapfiles
Toggle Surveys
List surveys
Stats
ITHEA Classification Structure > I. Computing Methodologies  > I.5 PATTERN RECOGNITION  > I.5.5 Implementation 
CHAIN SPLIT AND COMPUTATIONS IN PRACTICAL RULE MINING
By: Levon Aslanyan, Hasmik Sahakyan (5838 reads)
Rating: (1.00/10)

Abstract: A novel association rule mining algorithm is composed, using the unit cube chain decomposition structures introduced in HAN, 1966; TON, 1976. HAN, 1966 established the chain split theory. TON, 1976 invented an excellent chain computation framework which brings chain split into the practical domain. We integrate these technologies around the rule mining procedures. Effectiveness is related to the intention of low complexity of rules mined. Complexity of the procedure composed is complementary to the known Apriori algorithm which is defacto standard in rule mining area.

Keywords: Data mining, unite cube.

ACM Classification Keywords: 1.5. Pattern recognition, H.2.8 Database applications, Data mining.

Link:

CHAIN SPLIT AND COMPUTATIONS IN PRACTICAL RULE MINING

Levon Aslanyan, Hasmik Sahakyan

http://foibg.com/ibs_isc/ibs-08/ibs-08-p19.pdf

Print
I.5.5 Implementation
article: CHAIN SPLIT AND COMPUTATIONS IN PRACTICAL RULE MINING ·
Login
[ register | I forgot my password ]
World Clock
Powered by Tikiwiki Powered by PHP Powered by Smarty Powered by ADOdb Made with CSS Powered by RDF powered by The PHP Layers Menu System
RSS Wiki RSS Blogs rss Articles RSS Image Galleries RSS File Galleries RSS Forums RSS Maps rss Calendars
[ Execution time: 0.09 secs ]   [ Memory usage: 7.50MB ]   [ GZIP Disabled ]   [ Server load: 0.25 ]
Powered by Tikiwiki CMS/Groupware