Sciweavers

1458 search results - page 91 / 292
» Practical Preference Relations for Large Data Sets
Sort
View
CIDR
2011
337views Algorithms» more  CIDR 2011»
14 years 8 months ago
The Schema-Independent Database UI: A Proposed Holy Grail and Some Suggestions
If you have ever encountered a piece of highly domain-specific business software, you may have noticed that it was largely a graphical front-end to some relational database. You ...
Eirik Bakke, Edward Benson
WEBI
2010
Springer
15 years 2 months ago
Domain-Specific Backlinking Services in the Web of Data
Abstract--This paper describes an Open Linked Data backlinking service, a generic architecture component to support the discovery of useful links between items across highly connec...
Manuel Salvadores, Gianluca Correndo, Martin Szoms...
133
Voted
DEXAW
2005
IEEE
142views Database» more  DEXAW 2005»
15 years 10 months ago
Competitive Advantage from Data Mining: Some Lessons Learnt in the Information Systems Field
Data mining (DM) is still a technology having great expectations to enable organizations to take more benefit of their huge databases. There exist some success stories where organ...
Mykola Pechenizkiy, Seppo Puuronen, Alexey Tsymbal
ICDM
2010
IEEE
121views Data Mining» more  ICDM 2010»
15 years 3 months ago
Recommending Social Events from Mobile Phone Location Data
A city offers thousands of social events a day, and it is difficult for dwellers to make choices. The combination of mobile phones and recommender systems can change the way one de...
Daniele Quercia, Neal Lathia, Francesco Calabrese,...
ICML
2003
IEEE
16 years 5 months ago
Kernel PLS-SVC for Linear and Nonlinear Classification
A new method for classification is proposed. This is based on kernel orthonormalized partial least squares (PLS) dimensionality reduction of the original data space followed by a ...
Roman Rosipal, Leonard J. Trejo, Bryan Matthews