Sciweavers

2346 search results - page 246 / 470
» Discovering Case Knowledge Using Data Mining
Sort
View
AUSAI
2007
Springer
14 years 3 months ago
Merging Algorithm to Reduce Dimensionality in Application to Web-Mining
Dimensional reduction may be effective in order to compress data without loss of essential information. Also, it may be useful in order to smooth data and reduce random noise. The...
Vladimir Nikulin, Geoffrey J. McLachlan
AISC
2010
Springer
14 years 2 months ago
Dimensions of Formality: A Case Study for MKM in Software Engineering
Abstract. We study the formalization process of a collection of documents created for a Software Engineering project from an MKM perspective. We analyze how document and collection...
Andrea Kohlhase, Michael Kohlhase, Christoph Lange...
INFORMATICASI
1998
122views more  INFORMATICASI 1998»
13 years 9 months ago
Experimental Evaluation of Three Partition Selection Criteria for Decision Table Decomposition
Decision table decomposition is a machine learning approach that decomposes a given decision table into an equivalent hierarchy of decision tables. The approach aims to discover d...
Blaz Zupan, Marko Bohanec
IACR
2011
127views more  IACR 2011»
12 years 9 months ago
Oblivious RAM with O((log N)^3) Worst-Case Cost
Oblivious RAM (O-RAM) is a useful primitive that allows a client to hide its data access patterns from an untrusted server in storage outsourcing applications. This paper proposes...
Elaine Shi, T.-H. Hubert Chan, Emil Stefanov, Ming...
KDD
2002
ACM
175views Data Mining» more  KDD 2002»
14 years 10 months ago
Mining product reputations on the Web
Knowing the reputations of your own and/or competitors' products is important for marketing and customer relationship management. It is, however, very costly to collect and a...
Satoshi Morinaga, Kenji Yamanishi, Kenji Tateishi,...