Sciweavers

868 search results - page 135 / 174
» A general compression algorithm that supports fast searching
Sort
View
KDD
2002
ACM
140views Data Mining» more  KDD 2002»
14 years 9 months ago
Mining frequent item sets by opportunistic projection
In this paper, we present a novel algorithm OpportuneProject for mining complete set of frequent item sets by projecting databases to grow a frequent item set tree. Our algorithm ...
Junqiang Liu, Yunhe Pan, Ke Wang, Jiawei Han
SDM
2011
SIAM
232views Data Mining» more  SDM 2011»
13 years 5 hour ago
A Sequential Dual Method for Structural SVMs
In many real world prediction problems the output is a structured object like a sequence or a tree or a graph. Such problems range from natural language processing to computationa...
Shirish Krishnaj Shevade, Balamurugan P., S. Sunda...
SIGIR
2009
ACM
14 years 3 months ago
CompositeMap: a novel framework for music similarity measure
With the continuing advances in data storage and communication technology, there has been an explosive growth of music information from different application domains. As an effe...
Bingjun Zhang, Jialie Shen, Qiaoliang Xiang, Ye Wa...
CORR
2011
Springer
174views Education» more  CORR 2011»
13 years 29 days ago
Parameter Learning of Logic Programs for Symbolic-Statistical Modeling
We propose a logical/mathematical framework for statistical parameter learning of parameterized logic programs, i.e. de nite clause programs containing probabilistic facts with a ...
Yoshitaka Kameya, Taisuke Sato
WWW
2008
ACM
14 years 9 months ago
Substructure similarity measurement in chinese recipes
Improving the precision of information retrieval has been a challenging issue on Chinese Web. As exemplified by Chinese recipes on the Web, it is not easy/natural for people to us...
Liping Wang, Qing Li, Na Li, Guozhu Dong, Yu Yang