Sciweavers

325 search results - page 21 / 65
» Alternatives to two classic data structures
Sort
View
78
Voted
EMNLP
2007
14 years 11 months ago
Finding Good Sequential Model Structures using Output Transformations
In Sequential Viterbi Models, such as HMMs, MEMMs, and Linear Chain CRFs, the type of patterns over output sequences that can be learned by the model depend directly on the modelâ...
Edward Loper
KDD
2004
ACM
135views Data Mining» more  KDD 2004»
15 years 10 months ago
Discovering additive structure in black box functions
Many automated learning procedures lack interpretability, operating effectively as a black box: providing a prediction tool but no explanation of the underlying dynamics that driv...
Giles Hooker
KDD
2004
ACM
173views Data Mining» more  KDD 2004»
15 years 10 months ago
A microeconomic data mining problem: customer-oriented catalog segmentation
The microeconomic framework for data mining [7] assumes that an enterprise chooses a decision maximizing the overall utility over all customers where the contribution of a custome...
Martin Ester, Rong Ge, Wen Jin, Zengjian Hu
RAID
2009
Springer
15 years 4 months ago
PE-Miner: Mining Structural Information to Detect Malicious Executables in Realtime
In this paper, we present an accurate and realtime PE-Miner framework that automatically extracts distinguishing features from portable executables (PE) to detect zero-day (i.e. pr...
M. Zubair Shafiq, S. Momina Tabish, Fauzan Mirza, ...
WEA
2010
Springer
205views Algorithms» more  WEA 2010»
14 years 7 months ago
Practical Compressed Suffix Trees
Abstract. The suffix tree is an extremely important data structure for stringology, with a wealth of applications in bioinformatics. Classical implementations require much space, w...
Rodrigo Cánovas, Gonzalo Navarro