File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

postgraduate thesis: Finding frequent itemsets over bursty data streams

TitleFinding frequent itemsets over bursty data streams
Authors
Advisors
Advisor(s):Kao, CM
Issue Date2005
PublisherThe University of Hong Kong (Pokfulam, Hong Kong)
Citation
Lin, H. B. [林弘]. (2005). Finding frequent itemsets over bursty data streams. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b3204688
DegreeMaster of Philosophy
SubjectData mining.
Algorithms.
Dept/ProgramComputer Science

 

DC FieldValueLanguage
dc.contributor.advisorKao, CM-
dc.contributor.authorLin, Hong, Bill.-
dc.contributor.author林弘.-
dc.date.issued2005-
dc.identifier.citationLin, H. B. [林弘]. (2005). Finding frequent itemsets over bursty data streams. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b3204688-
dc.languageeng-
dc.publisherThe University of Hong Kong (Pokfulam, Hong Kong)-
dc.relation.ispartofHKU Theses Online (HKUTO)-
dc.rightsThe author retains all proprietary rights, (such as patent rights) and the right to use in future works.-
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.source.urihttp://hub.hku.hk/bib/B32046881-
dc.subject.lcshData mining.-
dc.subject.lcshAlgorithms.-
dc.titleFinding frequent itemsets over bursty data streams-
dc.typePG_Thesis-
dc.identifier.hkulb3204688-
dc.description.thesisnameMaster of Philosophy-
dc.description.thesislevelMaster-
dc.description.thesisdisciplineComputer Science-
dc.description.naturepublished_or_final_version-
dc.description.natureabstract-
dc.identifier.doi10.5353/th_b3204688-
dc.date.hkucongregation2005-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats