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 FieldValueLanguage
dc.contributor.authorBhatt, Dvijesh-
dc.contributor.authorDayma, Reshma-
dc.date.accessioned2015-06-24T07:15:05Z-
dc.date.available2015-06-24T07:15:05Z-
dc.date.issued2013-11-28-
dc.identifier.citation4th International Conference on Current Trends in Technology, NUiCONE - 2013, Institute of Technology, Nirma University, November 28 – 30, 2013en_US
dc.identifier.urihttp://hdl.handle.net/123456789/5454-
dc.description.abstractSequential 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.publisherIEEEen_US
dc.relation.ispartofseriesITFIT019-1-
dc.subjectData Miningen_US
dc.subjectPrefix Sequenceen_US
dc.subjectSequenceen_US
dc.subjectTime Intervalen_US
dc.subjectComputer Faculty Paperen_US
dc.subjectFaculty Paperen_US
dc.subjectITFIT019en_US
dc.subjectNUiCONE-
dc.subjectNUiCONE - 2013-
dc.titleImproved Clustering Technique for ITI PrefixSpanen_US
dc.typeFaculty Papersen_US
Appears in Collections:Faculty Papers, CE

Files in This Item:
File Description SizeFormat 
ITFIT019-1.pdfITFIT019-1215.11 kBAdobe PDFThumbnail
View/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.