faculty:denton:writingpapers
Differences
This shows you the differences between two versions of the page.
Next revision | Previous revision | ||
faculty:denton:writingpapers [2017/01/13 17:38] – created localadmin | faculty:denton:writingpapers [2017/01/13 17:41] (current) – [SSE and ARM on Continuous Multi-dimenstional data (Matt)] localadmin | ||
---|---|---|---|
Line 3: | Line 3: | ||
Discussion on what to put into a paper. | Discussion on what to put into a paper. | ||
+ | ===== Alan's Paper Writing Recommendations ===== | ||
+ | |||
+ | * Use present tense | ||
+ | * Avoid short paragraphs | ||
+ | * Punctuate equations | ||
+ | |||
+ | ===== Paper Components ===== | ||
+ | |||
+ | Abstract, Introduction, | ||
+ | |||
+ | I. Abstract | ||
+ | * Summary of the entire paper. | ||
+ | II. Introduction | ||
+ | * Motivation section... | ||
+ | 1.Why do people need it? | ||
+ | 2.How is it new? | ||
+ | 3.Why/how is it successful? | ||
+ | III. Background | ||
+ | 1. Related Works | ||
+ | 2. Background formalism (e.g., ARM definitions) | ||
+ | IV. Algorithm | ||
+ | * Should first concentrate on results, then define the algorithms with really new math (should be about 2 pages) | ||
+ | V. Results | ||
+ | * Plots- Good place to start the writing process (after motivation) | ||
+ | * Additional experimental description can wait. | ||
+ | VI. Conclusion | ||
+ | |||
+ | 2. How is it new? Can be answered with: | ||
+ | * More accurate (be careful, this is tempting but hard to achieve) | ||
+ | * Better scaling/ | ||
+ | * Solves a new problem | ||
+ | * A new perspective to an old problem | ||
+ | |||
+ | 3. How is it successful? Can be shown by: | ||
+ | * Results from 2 | ||
+ | * Better numbers for accuracy and complexity | ||
+ | * New approach is better than naive approach | ||
+ | * Naive must be practically naive (for completely new approaches can be very much so) | ||
+ | * New solutions may only be able to compare to the latest old solution | ||
+ | |||
+ | PLOTS: Probably need about as many as half the number of pages. | ||
+ | * One to show Quality | ||
+ | * One to show Efficiency | ||
+ | * One or two for partial results (performance key concepts) | ||
+ | * One or two drawings of key concepts (such as graphical version of data or search space) | ||
+ | |||
+ | Be sure that figures are legible at the size they will be printed/ | ||
+ | |||
+ | As Michael Stonebraker has said we need Respectable Graphs and Equations (RGE) | ||
+ | * Graphs are as above to show results | ||
+ | * Equations are the new math in the algorithm section | ||
+ | |||
+ | ===== ICDM Paper Deadlines ===== | ||
+ | |||
+ | Those submitting to the next conference (ICDM July 5) must meet the following deadlines: | ||
+ | |||
+ | Next Tuesday (June 6): Five page draft for a target paper of 10-12 pages. | ||
+ | |||
+ | * A couple of plots | ||
+ | * Related work (about 8 references) | ||
+ | * A start on new math | ||
+ | * Work on the three introduction points | ||
+ | * (May do abstract if you want) | ||
+ | |||
+ | This should provide motivation for the completion of your theory and experiments. | ||
+ | |||
+ | ===== LaTex and Writing ===== | ||
+ | |||
+ | We have a general standard of using < | ||
+ | |||
+ | Our current setup is to use a free version of < | ||
+ | |||
+ | ===== SSE and ARM on Continuous Multi-dimenstional data (Matt) ===== | ||
+ | |||
+ | An update on Matt's work. | ||
+ | |||
+ | A big point is that typical statistics is concerned with the entire data set. We will focus on finding the most useful subset of the data using measures of sum of squared errors (SSE) and Person' | ||
+ | |||
+ | Typical ARM finds itemsets that have support >= to the min. support. | ||
+ | |||
+ | The search has two aspects. 1) Intersection of transactions by growing the number of attributes considered. | ||
+ | |||
+ | The single attribute setup goes like: | ||
+ | '' | ||
+ | 1\\ | ||
+ | 2\\ | ||
+ | 3\\ | ||
+ | 12\\ | ||
+ | 23\\ | ||
+ | 123\\ | ||
+ | '' | ||
+ | |||
+ | Multiple attributes go like: | ||
+ | '' | ||
+ | A(12)\\ | ||
+ | B(1)\\ | ||
+ | C(1)\\ | ||
+ | A(1)B(1)\\ | ||
+ | :\\ | ||
+ | :\\ | ||
+ | '' | ||
+ | |||
+ | |||
+ | So, SSE across attribute sets is upward closed while SSE within a single attribute is downward closed. |
faculty/denton/writingpapers.1484350709.txt.gz · Last modified: by localadmin