As of August 2024, International Journal "Notes on Intuitionistic Fuzzy Sets" is being indexed in Scopus.
Please check our Instructions to Authors and send your manuscripts to nifs.journal@gmail.com. Next issue: September/October 2024.

Open Call for Papers: International Workshop on Intuitionistic Fuzzy Sets • 13 December 2024 • Banska Bystrica, Slovakia/ online (hybrid mode).
Deadline for submissions: 16 November 2024.

Issue:Temporal aspects of web log analysis

From Ifigenia, the wiki for intuitionistic fuzzy sets and generalized nets
Jump to navigation Jump to search
shortcut
http://ifigenia.org/wiki/issue:nifs/9/4/114-122
Title of paper: Temporal aspects of web log analysis
Author(s):
Ilias Petrounias
Department of Computation, UMIST, PO Box 88, Manchester M60 1QD, UK
A. Assaid
Department of Computation, UMIST, PO Box 88, Manchester M60 1QD, UK
Panagiotis Chountas
Department of Computer Science, University of Westminster, Northwick Watford Rd, Northwick Park, London, HA] 3TP, UK
Boyan Kolev
Centre for Biomedical Engineering, Bulgarian Academy of Sciences, Acad.G.Bonchev Str., BI.105, Sofia-1113, BULGARIA
Presented at: Seventh International Conference on IFSs, Sofia, 23-24 August 2003
Published in: "Notes on Intuitionistic Fuzzy Sets", Volume 9 (2003) Number 4, pages 114-122
Download:  PDF (5163  Kb, File info)
Abstract: This paper is concerned with mining temporal features from web logs. We present two methods. The first one concerns the temporal mining of sequential patterns in which we use sequence data which are used as support for discovered patterns in order to find periodicity in web log data. The second one concerns an efficient method for finding periodicity in web log sequence data which handles missing sequences by dealing with the overlap problem.


References:
  1. Chaudhuri, S., U., Dayal, (1997). An overview of Data warehousing and OLAP technology, ACM SIGMOD. 26:65-74.
  2. Demiriz, A, M. J., Zaki (2002). webSPADE: A Parallel Sequence Mining Algorithm to Analyze Web Log Data. SIGKDD °02 Edmonton, Alberta CA.
  3. Han, J., W., Gong, and Y., Yin, (1998). Mining segment-wise periodic patterns in time-related database. Proceedings of knowledge discovery and Data Mining (KDD'98).
  4. Zaki, M.J. Efficient Enumeration of Frequent Sequences. 7th International Conference on Information and Knowledge Management. Washington DC, pp. 68-75.
  5. M.J., Zaki, (2000). Sequence Mining in Categorical Domains: Incorporating Constraints, in 9th International Conference on Information and Knowledge Management Washington, DC., pp. 422-429.
  6. M.J., Zaki (2001). SPADE: An Efficient Algorithm for Mining Frequent Sequences. Machine Learning Journal, special issue on Unsupervised Learning (Doug Fisher, ed.). Vol. 42 Nos. 1/2: 31-60.
Citations:

The list of publications, citing this article may be empty or incomplete. If you can provide relevant data, please, write on the talk page.