IR @ Nirma University
Keeping in tune the global developments we are creating an institutional repository using DSpace Software (Digital Library Software). We are archiving institutional knowledge like, faculty papers, theses, and dissertations in PDF format at DSpace. Students can access this digital information anywhere in the campus.
Please use this identifier to cite or link to this item:
http://10.1.7.192:80/jspui/handle/123456789/5454| Title: | Improved Clustering Technique for ITI PrefixSpan |
| Authors: | Bhatt, Dvijesh Dayma, Reshma |
| Keywords: | Data Mining Prefix Sequence Sequence Time Interval Computer Faculty Paper Faculty Paper ITFIT019 NUiCONE NUiCONE - 2013 |
| Issue Date: | 28-Nov-2013 |
| Publisher: | IEEE |
| Citation: | 4th International Conference on Current Trends in Technology, NUiCONE - 2013, Institute of Technology, Nirma University, November 28 – 30, 2013 |
| Series/Report no.: | ITFIT019-1 |
| 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. |
| URI: | http://hdl.handle.net/123456789/5454 |
| 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.