Sciweavers

1308 search results - page 236 / 262
» Competitor Mining with the Web
Sort
View
RSFDGRC
2005
Springer
190views Data Mining» more  RSFDGRC 2005»
15 years 11 months ago
Finding Rough Set Reducts with SAT
Abstract. Feature selection refers to the problem of selecting those input features that are most predictive of a given outcome; a problem encountered in many areas such as machine...
Richard Jensen, Qiang Shen, Andrew Tuson
WEBI
2005
Springer
15 years 11 months ago
A Novel Way of Computing Similarities between Nodes of a Graph, with Application to Collaborative Recommendation
This work presents a new perspective on characterizing the similarity between elements of a database or, more generally, nodes of a weighted, undirected, graph. It is based on a M...
François Fouss, Alain Pirotte, Marco Saeren...
GI
2003
Springer
15 years 10 months ago
Semantic Methods and Tools for Information Portals
Abstract. The paper describes a set of approaches for representing and accessing information within a semantically structured information portal, while offering the possibility to ...
Sudhir Agarwal, Peter Fankhauser, Jorge Gonzalez-O...
WSDM
2010
ACM
211views Data Mining» more  WSDM 2010»
15 years 10 months ago
IntervalRank - Isotonic Regression with Listwise and Pairwise Constraints
Ranking a set of retrieved documents according to their relevance to a given query has become a popular problem at the intersection of web search, machine learning, and informatio...
Taesup Moon, Alex Smola, Yi Chang, Zhaohui Zheng
DIS
2001
Springer
15 years 10 months ago
Eliminating Useless Parts in Semi-structured Documents Using Alternation Counts
We propose a preprocessing method for Web mining which, given semi-structured documents with the same structure and style, distinguishes useless parts and non-useless parts in each...
Daisuke Ikeda, Yasuhiro Yamada, Sachio Hirokawa