Sciweavers

1414 search results - page 235 / 283
» Relational peculiarity-oriented mining
Sort
View
DKE
2008
109views more  DKE 2008»
13 years 8 months ago
Deterministic algorithms for sampling count data
Processing and extracting meaningful knowledge from count data is an important problem in data mining. The volume of data is increasing dramatically as the data is generated by da...
Hüseyin Akcan, Alex Astashyn, Hervé Br...
DKE
2008
88views more  DKE 2008»
13 years 8 months ago
Quantifying process equivalence based on observed behavior
In various application domains there is a desire to compare process models, e.g., to relate an organization-specific process model to a reference model, to find a web service matc...
Ana Karla Alves de Medeiros, Wil M. P. van der Aal...
IJSWIS
2006
168views more  IJSWIS 2006»
13 years 8 months ago
Unraveling the Taste Fabric of Social Networks
Popular online social networks such as Friendster and MySpace do more than simply reveal the superficial structure of social connectedness--the rich meanings bottled within social...
Hugo Liu, Pattie Maes, Glorianna Davenport
WWW
2011
ACM
13 years 3 months ago
Improving recommendation for long-tail queries via templates
The ability to aggregate huge volumes of queries over a large population of users allows search engines to build precise models for a variety of query-assistance features such as ...
Idan Szpektor, Aristides Gionis, Yoelle Maarek
SDM
2011
SIAM
218views Data Mining» more  SDM 2011»
12 years 11 months ago
Segmented nestedness in binary data
A binary matrix is fully nested if its columns form a chain of subsets; that is, any two columns are ordered by the subset relation, where we view each column as a subset of the r...
Esa Junttila, Petteri Kaski