• Home
  • Search
  • Multi-Instance Learning Based Web Mining
  • Cite Icon145
  • https://doi.org/10.1007/s10489-005-5602-zCopy DOI Icon

Multi-Instance Learning Based Web Mining

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

In multi-instance learning, the training set comprises labeled bags that are composed of unlabeled instances, and the task is to predict the labels of unseen bags. In this paper, a web mining problem, i.e. web index recommendation, is investigated from a multi-instance view. In detail, each web index page is regarded as a bag, while each of its linked pages is regarded as an instance. A user favoring an index page means that he or she is interested in at least one page linked by the index. Based on the browsing history of the user, recommendation could be provided for unseen index pages. An algorithm named Fretcit-kNN, which employs the Minimal Hausdorff distance between frequent term sets and utilizes both the references and citers of an unseen bag in determining its label, is proposed to solve the problem. Experiments show that in average the recommendation accuracy of Fretcit-kNN is 81.0% with 71.7% recall and 70.9% precision, which is significantly better than the best algorithm that does not consider the specific characteristics of multi-instance learning, whose performance is 76.3% accuracy with 63.4% recall and 66.1% precision.

Similar Papers
  • Book Chapter
  • Citations14

A Study on Text Clustering Algorithms Based on Frequent Term Sets

  • Jan 01, 2005
  • Xiangwei Liu +1
  • Conference Article
  • Citations8

The research of text clustering algorithms based on frequent term sets

  • Jan 01, 2005
  • Xiang-Wei Liu +2
  • Book Chapter
  • Citations3

Short Text Feature Extension Based on Improved Frequent Term Sets

  • Jan 01, 2016
  • Huifang Ma +4
  • Research Article
  • Citations24

Feature Extension for Short Text Categorization Using Frequent Term Sets

  • Jan 01, 2014
  • Procedia Computer Science
  • Yuan Man
  • Conference Article
  • Citations2

Study on frequent term set-based hierarchical clustering algorithm

  • Jul 01, 2011
  • Huiying Wang +1
  • Book Chapter
  • Citations13

A Hybrid Algorithm for Web Document Clustering Based on Frequent Term Sets and k-Means

  • Jun 16, 2007
  • Le Wang +3
  • Book Chapter
  • Citations5

An Integrated Approach and Framework for Document Clustering Using Graph Based Association Rule Mining

  • Jan 01, 2014
  • D S Rajput +2
  • Research Article
  • Citations8

Feature selection in multi-instance learning

  • Jul 07, 2012
  • Neural Computing and Applications
  • Rui Gan +1
  • Research Article
  • Citations158

Solving multi-instance problems with classifier ensemble based on constructive clustering

  • Aug 10, 2006
  • Knowledge and Information Systems
  • Zhi-Hua Zhou +1
  • Research Article
  • Citations8

Efficient and accurate personalized product recommendations through frequent item set mining fusion algorithm

  • Jan 19, 2024
  • Heliyon
  • Lifeng Kang +1
  • Book Chapter

Knowledge Discovery in Web Usage Patterns Using Pageviews and Data Mining Association Rule

  • Jan 01, 2022
  • G Vijaiprabhu +2
  • Conference Article
  • Citations8

Mining Actionable Behavioral Rules Based on Decision Tree Classifier

  • Aug 01, 2017
  • Peng Su +3
  • Book Chapter
  • Citations74

Frequent Set Mining

  • Jan 01, 2009
  • Bart Goethals
  • Conference Article
  • Citations35

Pattern Mining from big IoT Data with fog Computing: Models, Issues, and Research Perspectives

  • May 01, 2019
  • Peter Braun +5
  • Supplementary Content
  • Citations3

Personalised Recommendation of PE Network Course Environment Resources Using Data Mining Analysis.

  • Jan 01, 2022
  • Journal of Environmental and Public Health
  • Fanting Min
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.