Please use this identifier to cite or link to this item: https://ptsldigital.ukm.my/jspui/handle/123456789/394944
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSuraya Alias-
dc.contributor.authorNorita Md Norwawi-
dc.date.accessioned2023-06-15T07:52:35Z-
dc.date.available2023-06-15T07:52:35Z-
dc.identifier.otherukmvital:122438-
dc.identifier.urihttps://ptsldigital.ukm.my/jspui/handle/123456789/394944-
dc.description.abstractAs the web log data is considered as complex and temporal, applying Sequential Pattern Mining technique becomes a challenging task. The min sup threshold issue is highlighted - as a pattern is considered as frequent if it meets the specified min sup. If the min sup is high, few patterns are discovered else the mining process will be longer if too many patterns generated using low min sup. The format of web log data that creates consecutive occurring pages has made it difficult to generate frequent sequences. Also, as each user' behaviour is unique; using one min sup value for all users may affect the pattern generation. This research introduced a personalized minimum support threshold for each web users using their Median item access (support) value to curb this problem. The pSPADE performance was the highest on the discovery of user's origin and also interesting pattern discovery attribute.-
dc.language.isoeng-
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE),Piscataway, US-
dc.subjectMining sequential pattern-
dc.subjectThreshold value-
dc.titlepSPADE : mining sequential pattern using personalized support threshold value-
dc.typeSeminar Papers-
dc.format.pages8-
dc.identifier.callnoT58.5.C634 2008 kat sem j.2-
dc.contributor.conferencenameInternational Symposium on Information Technology-
dc.coverage.conferencelocationKuala Lumpur Convention Centre-
dc.date.conferencedate26/08/2008-
Appears in Collections:Seminar Papers/ Proceedings / Kertas Kerja Seminar/ Prosiding

Files in This Item:
There are no files associated with this item.


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