Please use this identifier to cite or link to this item:
http://10.1.7.192:80/jspui/handle/123456789/5454
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Bhatt, Dvijesh | - |
dc.contributor.author | Dayma, Reshma | - |
dc.date.accessioned | 2015-06-24T07:15:05Z | - |
dc.date.available | 2015-06-24T07:15:05Z | - |
dc.date.issued | 2013-11-28 | - |
dc.identifier.citation | 4th International Conference on Current Trends in Technology, NUiCONE - 2013, Institute of Technology, Nirma University, November 28 – 30, 2013 | en_US |
dc.identifier.uri | http://hdl.handle.net/123456789/5454 | - |
dc.description.abstract | Sequential data mining is the process to find out the frequent sub-sequences from the given sequential dataset. Sequential pattern mining can only reveal the sequence (order) of items, but it does not determined the time interval between two successive events. Time interval sequential mining is process to find out sequential patterns with time interval between two successive events. In this paper, we will introduce the new cluster technique so we will get dynamic cluster range rather than fixed. We improve the result of new ITI-PrefixSpan and compare our algorithm with other algorithms in terms of computing time and memory. | en_US |
dc.publisher | IEEE | en_US |
dc.relation.ispartofseries | ITFIT019-1 | - |
dc.subject | Data Mining | en_US |
dc.subject | Prefix Sequence | en_US |
dc.subject | Sequence | en_US |
dc.subject | Time Interval | en_US |
dc.subject | Computer Faculty Paper | en_US |
dc.subject | Faculty Paper | en_US |
dc.subject | ITFIT019 | en_US |
dc.subject | NUiCONE | - |
dc.subject | NUiCONE - 2013 | - |
dc.title | Improved Clustering Technique for ITI PrefixSpan | en_US |
dc.type | Faculty Papers | en_US |
Appears in Collections: | Faculty Papers, CE |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
ITFIT019-1.pdf | ITFIT019-1 | 215.11 kB | Adobe PDF | ![]() View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.