CORR 2000 - PDF Preprint Papers

CORR 2000 Workshop on Service Oriented Computing

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed CORR-2000 Paper

click to vote

CORR
2000
Springer

230views Education» more CORR 2000»

Integrating E-Commerce and Data Mining: Architecture and Challenges

13 years 11 months ago

Download robotics.stanford.edu

We show that the e-commerce domain can provide all the right ingredients for successful data mining. We describe an integrated architecture for supporting this integration. The ar...

Suhail Ansari, Ron Kohavi, Llew Mason, Zijian Zhen...

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	230	Integrating E-Commerce and Data Mining: Architecture and Challenges	claim
2	149	On The Closest String and Substring Problems	claim
3	144	Sequence-Based Abstract Interpretation of Prolog	claim
4	138	Towards rule-based visual programming of generic visual systems	claim
5	134	Boosting the Differences: A fast Bayesian classifier neural network	claim
6	134	Learning Complexity Dimensions for a Continuous-Time Control System	claim
7	133	On Exponential-Time Completeness of the Circularity Problem for Attribute Grammars	claim
8	132	Uniform semantic treatment of default and autoepistemic logics	claim
9	132	Declarative Representation of Revision Strategies	claim
10	132	A Comparison between Supervised Learning Algorithms for Word Sense Disambiguation	claim
11	129	Prosody-Based Automatic Segmentation of Speech into Sentences and Topics	claim
12	128	Optimization of Trading Physics Models of Markets	claim
13	128	Faster Evaluation of Multidimensional Integrals	claim
14	126	Learning to Filter Spam E-Mail: A Comparison of a Naive Bayesian and a Memory-Based Approach	claim
15	126	Biologically Motivated Distributed Designs for Adaptive Knowledge Management	claim
16	125	Abductive reasoning with temporal information	claim
17	120	Scaling Up Inductive Logic Programming by Learning from Interpretations	claim
18	116	Algorithmic Statistics	claim
19	115	Exploiting Diversity in Natural Language Processing: Combining Parsers	claim
20	115	Modeling Ambiguity in a Multi-Agent System	claim
21	112	Evolution of differentiated expression patterns in digital organisms	claim
22	110	Finite-State Non-Concatenative Morphotactics	claim
23	110	Efficient probabilistic top-down and left-corner parsing	claim
24	109	TnT - A Statistical Part-of-Speech Tagger	claim
25	109	Bootstrapping a Tagged Corpus through Combination of Existing Heterogeneous Taggers	claim
26	107	Computing Presuppositions by Contextual Reasoning	claim
27	107	How to Evaluate your Question Answering System Every Day and Still Get Real Work Done	claim
28	106	Practical Reasoning for Very Expressive Description Logics	claim
29	104	ATLAS: A flexible and extensible architecture for linguistic annotation	claim
30	104	The information bottleneck method	claim
31	104	Quantum error-correcting codes associated with graphs	claim
32	103	Towards a query language for annotation graphs	claim
33	103	Automatic Termination Analysis of Programs Containing Arithmetic Predicates	claim
34	100	Boosting Applied to Word Sense Disambiguation	claim
35	100	Transformation-Based Bottom-Up Computation of the Well-Founded Model	claim
36	100	Algorithms for Analysing Firewall and Router Access Lists	claim
37	100	Perfect simulation from the Quicksort limit distribution	claim
38	99	Causes and Explanations: A Structural-Model Approach, Part I: Causes	claim
39	99	Web Mining Research: A Survey	claim
40	99	Adaptive simulated annealing (ASA): Lessons learned	claim
41	99	High-resolution path-integral development of financial options	claim
42	98	Scientific Collaboratories as Socio-Technical Interaction Networks: A Theoretical Approach	claim
43	98	The Sound Manifesto	claim
44	97	A characterization of the set of fixed points of the Quicksort transformation	claim
45	96	Robustness of Regional Matching Scheme over Global Matching Scheme	claim
46	96	A Bayesian Reflection on Surfaces	claim
47	95	Cluster Computing: A High-Performance Contender	claim
48	95	Effect of different packet sizes on RED performance	claim
49	95	One Complexity Theorist's View of Quantum Computing	claim
50	93	The Random Oracle Methodology, Revisited	claim
51	93	Lattice Structure and Convergence of a Game of Cards	claim
52	92	Predicting the expected behavior of agents that learn about agents: the CLRI framework	claim
53	92	DISCO: An object-oriented system for music composition and sound design	claim
54	92	Evolution of Biological Complexity	claim
55	91	Multi-Agent Only Knowing	claim
56	91	Algorithmic Theories of Everything	claim
57	90	Parameter-free Model of Rank Polysemantic Distribution	claim
58	89	Approximation and Exactness in Finite State Optimality Theory	claim
59	88	The lexicographic closure as a revision process	claim
60	88	A Benchmark for Image Retrieval using Distributed Systems over the Internet: BIRDS-I	claim
61	88	About the globular homology of higher dimensional automata	claim
62	87	Searching for Spaceships	claim
63	87	Security Policy Consistency	claim
64	86	Variable Word Rate N-grams	claim
65	86	Connectivity Compression for Irregular Quadrilateral Meshes	claim
66	85	Occam factors and model-independent Bayesian learning of continuous distributions	claim
67	85	Conditional Plausibility Measures and Bayesian Networks	claim
68	85	Brainstorm/J: a Java Framework for Intelligent Agents	claim
69	85	Phutball Endgames are Hard	claim
70	85	A Note on Power-Laws of Internet Topology	claim
71	84	Using a Diathesis Model for Semantic Parsing	claim
72	84	Differential Invariants under Gamma Correction	claim
73	84	Robust Classification for Imprecise Environments	claim
74	84	The Role of Commutativity in Constraint Propagation Algorithms	claim
75	83	Agents of Choice: Tools that Facilitate Notice and Choice about Web Site Data Practices	claim
76	82	Measures of Distributional Similarity	claim
77	82	Representation results for defeasible logic	claim
78	82	On Modular Termination Proofs of General Logic Programs	claim
79	82	One-Dimensional Peg Solitaire	claim
80	81	Dialogue Act Modeling for Automatic Tagging and Recognition of Conversational Speech	claim
81	81	Safe cooperative robot dynamics on graphs	claim
82	81	Torque Ripple Minimization in a Switched Reluctance Drive by Neuro-Fuzzy Compensation	claim
83	81	Poly-locality in quantum computing	claim
84	79	Local Diagnosis	claim
85	79	Many uses, many annotations for large speech corpora: Switchboard and TDT as case studies	claim
86	79	Introduction to the CoNLL-2000 Shared Task: Chunking	claim
87	79	Making news understandable to computers	claim
88	78	One Sense per Collocation and Genre/Topic Variations	claim
89	77	An Average Analysis of Backtracking on Random Constraint Satisfaction Problems	claim
90	77	Metonymy Interpretation Using X NO Y Examples	claim
91	77	Index Assignment for Multichannel Communication under Failure	claim
92	75	Noun-phrase co-occurrence statistics for semi-automatic semantic lexicon construction	claim
93	75	A Learning Approach to Shallow Parsing	claim
94	73	Interval Constraint Solving for Camera Control and Motion Planning	claim
95	73	Structure of some sand pile model	claim
96	73	Polynomial-time Computation via Local Inference Relations	claim
97	72	A Theory of Universal Artificial Intelligence based on Algorithmic Complexity	claim
98	72	Relevance as Deduction: A Logical View of Information Retrieval	claim
99	72	Applications of Data Mining to Electronic Commerce	claim
100	71	An evaluation of Naive Bayesian anti-spam filtering	claim
101	71	Smoothness and decay properties of the limiting Quicksort density function	claim
102	70	Order-consistent programs are cautiously monotonic	claim
103	69	Designing Proxies for Stock Market Indices is Computationally Hard	claim
104	69	Cluster Computing White Paper	claim
105	67	Recognition Performance of a Structured Language Model	claim
106	67	Optimization with Extremal Dynamics	claim
107	67	The dynamics of iterated transportation simulations	claim
108	66	Super Logic Programs	claim
109	66	A network file system over HTTP: remote access and modification of files and "files"	claim
110	64	On the Development of the Intersection of a Plane with a Polytope	claim
111	64	Flipturning polygons	claim
112	64	Compiling Language Definitions: The ASF+SDF Compiler	claim
113	63	Pattern Discovery and Computational Mechanics	claim
114	63	Verifying Termination and Error-Freedom of Logic Programs with block Declarations	claim
115	63	Termination analysis of logic programs using acceptability with general term orders	claim
116	62	SLT-Resolution for the Well-Founded Semantics	claim
117	62	Requirements of Text Processing Lexicons	claim
118	58	On the semantics of merging	claim
119	58	Temporal Expressions in Japanese-to-English Machine Translation	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers