Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Given a set of points in Euclidean space, a minimum log likelihood ratio threshold, and a statistical significance threshold, Elliptical Hotspot Detection (EHD) finds elliptical hotspot areas where the concentration of activities inside is significantly higher than outside. The EHD problem is important to many fields, such as criminology, transportation engineering, and epidemiology. Related work (e.g., SatScan) enumerates only circular candidates using activities as centers, and may miss many significant ellipses. EHD problem is challenging for two reasons, namely the large enumeration space and the lack of monotonicity of the log likelihood ratio. To overcome the challenges and limitations of the related work, this paper proposes a novel algorithm for EHD. A case study on real crime data shows that our algorithm is able to find hotspots that cannot be detected by the related work. Experimental evaluation shows that the proposed algorithm saves substantial amount of computation compared to the naive approach.
['Xun Tang', 'Emre Eftelioglu', 'Shashi Shekhar']
I am writing a research paper on a idea Elliptical Hotspot Detection: A Summary of Results
[{"from": "human", "value": "I am writing a research paper on a idea Elliptical Hotspot Detection: A Summary of Results"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Given a set of points in Euclidean space, a minimum log likelihood ratio threshold, and a statistical significance threshold, Elliptical Hotspot Detection (EHD) finds elliptical hotspot areas where the concentration of activities inside is significantly higher than outside. The EHD problem is important to many fields, such as criminology, transportation engineering, and epidemiology. Related work (e.g., SatScan) enumerates only circular candidates using activities as centers, and may miss many significant ellipses. EHD problem is challenging for two reasons, namely the large enumeration space and the lack of monotonicity of the log likelihood ratio. To overcome the challenges and limitations of the related work, this paper proposes a novel algorithm for EHD. A case study on real crime data shows that our algorithm is able to find hotspots that cannot be detected by the related work. Experimental evaluation shows that the proposed algorithm saves substantial amount of computation compared to the naive approach."}]